Apparatus and method for in-line insertion and removal of markers

ABSTRACT

An apparatus is provided, for performing a direct memory access (DMA) operation between a host memory in a first server and a network adapter. The apparatus includes a host frame parser and a protocol engine. The host frame parser is configured to receive data corresponding to the DMA operation from a host interface, and is configured to insert markers on-the-fly into the data at a prescribed interval and to provide marked data for transmission to a second server over a network fabric. The protocol engine is coupled to the host frame parser. The protocol engine is configured to direct the host frame parser to insert the markers, and is configured to specify a first marker value and an offset value, whereby the host frame parser is enabled to locate and insert a first marker into the data.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of prior co-pending U.S. patentapplication Ser. No. 11/624,849 filed Jan. 19, 2007, which priorco-pending application claims the benefit of U.S. ProvisionalApplication Ser. No. 60/760,336 filed on Jan. 19, 2006, which priorco-pending application and provisional application are hereinincorporated by reference for all intents and purposes.

This application is related to the following co-pending U.S. patentapplications, all of which have a common assignee and common inventors.

SERIAL FILING NUMBER DATE TITLE 11/315,685 Dec. 22, 2005 APPARATUS ANDMETHOD (BAN.0202) FOR PACKET TRANSMISSION OVER A HIGH SPEED NETWORKSUPPORTING REMOTE DIRECT MEMORY ACCESS OPERATIONS 11/357,445 Feb. 17,2006 APPARATUS AND METHOD (BAN.0205) FOR OUT-OF-ORDER PLACEMENT ANDIN-ORDER COMPLETION REPORTING OF REMOTE DIRECT MEMORY ACCESS OPERATIONS11/357,449 Feb. 17, 2006 APPARATUS AND METHOD FOR (BAN.0220) STATELESSCRC CALCULATION

BACKGROUND OF THE INVENTION

1. Field of the Invention

This invention relates in general to the field of computercommunications and more specifically to an apparatus and method foreffectively and efficiently inserting and removing MPA markers into aTCP byte stream for communicating via an RDMA-over-Ethernet fabric.

2. Description of the Related Art

The first computers were stand-alone machines, that is, they loaded andexecuted application programs one-at-a-time in an order typicallyprescribed through a sequence at instructions provided by keypunchedbatch cards or magnetic tape. All of the data required to execute aloaded application program was provided by the application program asinput data and execution results were typically output to a lineprinter. Even though the interface to early computers was cumbersome atbest, the sheer power to rapidly perform computations made these devicesvery attractive to those in the scientific and engineering fields.

The development of remote terminal capabilities allowed computertechnologies to be more widely distributed. Access to computationalequipment in real time fostered the introduction of computers into thebusiness world. Businesses that processed large amounts of data, such asthe insurance industry and government agencies, began to store,retrieve, and process their data on computers. Special applications weredeveloped to perform operations on shared data within a single computersystem.

During the mid 1970's, a number of successful attempts were made tointerconnect computers for purposes of sharing data and/or processingcapabilities. These interconnection attempts, however, employed specialpurpose protocols that were intimately tied to the architecture of thesecomputers. As such, the computers were expensive to procure and maintainand their applications were limited to those areas of the industry thatheavily relied upon shared data processing capabilities.

The U.S. government, however, realized the power that could be harnessedby allowing computers to interconnect, and thus funded research thatresulted in what we now know as the Internet. More specifically, thisresearch resulted in a series of standards that specify the details ofhow interconnected computers are to communicate, how to interconnectnetworks of computers, and how to route traffic over theseinterconnected networks. This set of standards is known as the TCP/IPInternet Protocol Suite, named after its two predominant protocolstandards, Transport Control Protocol (TCP) and Internet Protocol (IP).TCP is a protocol that allows for a reliable byte stream connectionbetween two computers. IP is a protocol that provides an addressing androuting mechanism for unreliable transmission of datagrams across anetwork of computers. The use of TCP/IP allows a computer to communicateacross any set of interconnected networks, regardless of the underlyingnative network protocols that are employed by these networks. Once theinterconnection problem was solved by TCP/IP, networks of interconnectedcomputers began to crop up in all areas of business.

The ability to easily interconnect computer networks for communicationpurposes provided the motivation for the development of distributedapplication programs, that is, application programs that perform certaintasks on one computer connected to a network and certain other tasks onanother computer connected to the network. The sophistication ofdistributed application programs has steadily evolved over more recentyears into what we today call the client-server model. According to themodel, “client” applications on a network make requests for service to“server” applications on the network. The “server” applications performthe service and return the results of the service to the “client” overthe network. In an exact sense, a client and a server may reside on thesame computer, but the more common employment of the model finds clientsexecuting on smaller, less powerful, less costly computers connected toa network and servers executing on more powerful, more expensivecomputers. In fact, the proliferation of client-server applications hasresulted in a class of high-end computers being known as “servers”because they are primarily used to execute server applications.Similarly, the term “client machine” is often used to describe asingle-user desktop system that executes client applications.

Client-server application technology has enabled computer usage to bephased into the business mainstream. Companies began employinginterconnected client-server networks to centralize the storage offiles, company data, manufacturing data, etc., on servers and allowedemployees to access this data via clients. Servers today are sometimesknown by the type of services that they perform. For example, a theserver provides client access to centralized files, a mail serverprovides access to a company's electronic mail, a data base serverprovides client access to a central data base, and so on.

The development of other technologies such as hypertext markup language(HTML) and extensible markup language (XML) now allows user-friendlyrepresentations of data to be transmitted between computers. The adventof HTML/XML-based developments has resulted in an exponential increasein the number of computers that are interconnected because, now, evenhome-based businesses can develop server applications that provideservices accessible over the Internet from any computer equipped with aweb browser application (i.e., a web “client”). Furthermore, virtuallyevery computer produced today is sold with web client software. In 1988,only 5,000 computers were interconnected via the Internet. In 1995,under five million computers were interconnected via the Internet. Butwith the maturation of client-server and HTML technologies, presently,over 50 million computers access the Internet. And the growth continues.

The number of servers in a present day data center may range from asingle server to hundreds of interconnected servers. And theinterconnection schemes chosen for those applications that consist ofmore than one server depend upon the type of services thatinterconnection of the servers enables Today, there are three distinctinterconnection fabrics that characterize a multi-server configuration.Virtually all multi-server configurations have a local area network(LAN) fabric that is used to interconnect any number of client machinesto the servers within the data center. The LAN fabric interconnects theclient machines and allows the client machines access to the servers andperhaps also allows client and server access to network attached storage(NAS), if provided. One skilled in the art will appreciate that TCP/IPover Ethernet is the most commonly employed protocol in use today for aLAN fabric, with 100 Megabit (Mb) Ethernet being the most commontransmission speed and 1 Gigabit (Gb) Ethernet gaining prevalence inuse. In addition, 10 Gb Ethernet links and associated equipment arecurrently being fielded.

The second type of interconnection fabric, if required within a datacenter, is a storage area network (SAN) fabric. The SAN fabric providesfor high speed access of block storage devices by the servers. Again,one skilled in the art will appreciate that Fibre Channel is the mostcommonly employed protocol for use today for a SAN fabric, transmittingdata at speeds up to 2 Gb per second, with 4 Gb per second componentsthat are now in the early stages of adoption.

The third type of interconnection fabric, if required within a datacenter, is a clustering network fabric. The clustering network fabric isprovided to interconnect multiple servers to support such applicationsas high-performance computing, distributed databases, distributed datastore, grid computing, and server redundancy. A clustering networkfabric is characterized by super-fast transmission speed andlow-latency. There is no prevalent clustering protocol in use today, soa typical clustering network will employ networking devices developed bya given manufacturer. Thus, the networking devices (i.e., the clusteringnetwork fabric) operate according to a networking protocol that isproprietary to the given manufacturer. Clustering network devices areavailable from manufacturers such as Quadrics Inc. and Myricom. Thesenetwork devices transmit data at speeds greater than 1 Gb per second(Gb/sec) with latencies on the order of microseconds. It is interesting,however, that although low latency has been noted as a desirableattribute for a clustering network, more than 50 percent of the clustersin the top 500 fastest computers today use TCP/IP over Ethernet as theirinterconnection fabric.

It has been observed by many in the art that a significant performancebottleneck associated with networking in the near term will not be thenetwork fabric itself, as has been the case in more recent years.Rather, the bottleneck is now shifting to the processor. Morespecifically, network transmissions will be limited by the amount ofprocessing required of a central processing unit (CPU) to accomplishTCP/IP operations at 1 Gb/sec (and greater) speeds. In fact, the presentinventors have noted that approximately 40 percent of the CPU overheadassociated with TCP/IP operations is due to transport processing, thatis, the processing operations that are required to allocate buffers toapplications, to manage TCP/IP link lists, etc. Another 20 percent ofthe CPU overhead associated with TCP/IP operations is due to theprocessing, operations which are required to make intermediate buffercopies, that is, moving data from a network adapter buffer, then to adevice driver buffer, then to an operating system buffer, and finally toan application buffer. And the final 40 percent of the CPU overheadassociated with TCP/IP operations is the processing required to performcontext switches between an application and its underlying operatingsystem which provides the TCP/IP services. Presently, it is estimatedthat it takes roughly 1 GHz of processor bandwidth to provide for atypical 1 Gb/second TCP/IP network. Extrapolating this estimate up tothat required to support a 10 Gb/second TCP/IP network provides asufficient basis for the consideration of alternative configurationsbeyond the TCP/IP stack architecture of today, most of the operations ofwhich are provided by an underlying operating system.

As alluded to above, it is readily apparent that TCP/IP processingoverhead requirements must be offloaded from the processors andoperating systems within a server configuration in order to alleviatethe performance bottleneck associated with current and future networkingfabrics. This can be accomplished in principle by 1) moving thetransport processing requirements from the CPU down to a networkadapter; 2) providing a mechanism for remote direct memory access (RDMA)operations, thus giving the network adapter the ability to transfer datadirectly to/from application memory; and 3) providing a user-leveldirect access technique that allows an application to directly commandthe network adapter to send/receive data, thereby bypassing theunderlying operating system.

The INFINIBAND™ protocol vas an ill-fated attempt to accomplish thesethree “offload” objectives, while at the same time attempting toincrease data transfer speeds within a data center. In addition,INFINIBAND attempted to merge the three disparate fabrics (i.e., LAN,SAN, and cluster) by providing a unified point-to-point fabric that,among other things, completely replaces Ethernet, Fibre Channel, andvendor-specific clustering networks. On paper and in simulation, theINFINIBAND protocol was extremely attractive from a performanceperspective because it enabled all three of the above objectives andincreased networking throughput overall. Unfortunately, the architectsof INFINIBAND overestimated the community's willingness to abandon theirtremendous investment in existing networking infrastructure,particularly that associated with Ethernet fabrics. And as a result,INFINIBAND has not become a viable option for the marketplace.

INFINIBAND did, however, provide a very attractive mechanism foroffloading reliable connection network transport processing from a CPUand corresponding operating system. One aspect of this mechanism is theuse of “verbs.” Verbs is an abstract architected programming interfacebetween a network input/output (I/O) adapter and a host operating system(OS) or application software, which 1) enables moving reliableconnection transport processing from a host CPU to the I/O adapter; 2)provides for the I/O adapter to perform direct data placement (DDP)through the use of RDMA read messages and RDMA write messages, as willbe described in greater detail below; and 3) enables bypass of the OS.INFINIBAND defined a new type of reliable connection transport for usewith verbs, but as one skilled in the art will appreciate, a verbsinterface mechanism will work equally well with the TCP reliableconnection transport. At a very high level, this mechanism consists ofproviding a set of commands (“verbs”) which can be executed by anapplication program, without operating system intervention, that directan appropriately configured network adapter (not part of the CPU) todirectly transfer data to/from server (or “host”) memory, across anetwork fabric, where commensurate direct data transfer operations areperformed in host memory of a counterpart server. This type ofoperation, as noted above, is referred to as RDMA, and a network adapterthat is configured to perform such operations is referred to as anRDMA-enabled network adapter. In essence, an application executes a verbto transfer data and the RDMA-enabled network adapter moves the dataover the network fabric to/from host memory.

Many in the art have attempted to preserve the attractive attributes ofINFINIBAND (e.g., reliable connection network transport offload, verbs,RDMA) as part of a networking protocol that utilizes Ethernet as anunderlying network fabric. In fact, over 50 member companies are nowpart of what is known as the RDMA Consortium (www rdmaconsortium.org),an organization founded to foster industry standards and specificationsthat support RDMA over TCP. RDMA over TCP/IP defines the interoperableprotocols to support RDMA operations over standard TCP/IP networks. Todate, the RDMA Consortium has released four specifications that providefor RDMA over TCP, as follows, each of which is incorporated byreference in its entirety for all intents and purposes:

-   -   Hilland et al. “RDMA Protocol Verbs Specification (Version        1.0).” April, 2003, RDMA Consortium. Portland, Oreg.        (http://www.rdmaconsortium.org/home/draft-hilland-iwarp-verbs-v1.0-rdmac.pdf).    -   Recio et al. “An RDMA Protocol Specification (Version 1.0).”        October 2002. RDMA Consortium. Portland, Oreg.        (http://www.rdmaconsortium.org/home/draft-recio-iwarp-rdmap-v1.0.pdf).    -   Shah et al. “Direct Data Placement Over Reliable Transports        Version 1.0).” October 2002. RDMA Consortium. Portland, Oreg.        (http://www.rdmaconsortium.org/home/draft-shah-iwarp-ddp-v1.0.pdf).    -   Culley et al. “Marker PDU Aligned Framing for TCP Specification        (Version 1.0).” Oct. 25, 2002. RDMA Consortium. Portland, Oreg.        (http://www.rdmaconsortium.org/home/draft-culley-iwarp-mpa-v1.0.pdf).

The RDMA Verbs specification and the suite of three specifications thatdescribe the RDMA over TCP protocol have been completed. RDMA overTCP/IP specifies an RDMA layer that will intemperate over a standardTCP/IP transport layer, RDMA over TCP does not specify a physical layer,but will work over Ethernet, wide area networks (WAN), or any othernetwork where TCP/IP is used. The RDMA Verbs specification issubstantially similar to that provided for by INFINIBAND. In addition,the aforementioned specifications have been adopted as the basis forwork on RDMA by the Internet Engineering Task Force (IETF). The IETFversions of the RDMA over TCP specifications follow.

-   -   “Marker PDU Aligned Framing for TCP Specification (Sep. 27,        2005)”        http://www.ietf.org/internet-drafts/draft-ietf-rddp-mpa-03.pdf    -   “Direct Data Placement over Reliable Transports (July 2005)”        http://www.ietf.org/internet-drafts/draft-ietf-rddp-ddp-05.txt    -   “An RDMA Protocol Specification (Jul. 17, 2005)”        http://www.ietf.org/internet-drafts/draft-ietf-rddp-rdmap-05.txt    -   Remote Direct Data Placement (rddp) Working Group        http://www.ietf.org/html.charters/rddp-charter.html

In view of the above developments in the art, it is anticipated thatRDMA over TCP/IP, with Ethernet as the underlying network fabric, willover the near term become as ubiquitous within data centers as arecurrently fielded TCP/IP-based fabrics. The present inventorscontemplate that as RDMA over TCP/IP gains prevalence for use as a LANfabric, data center managers will recognize that increased overall costof ownership benefits can be had by moving existing SAN and clusteringfabrics over to RDMA over TCP/IP as well.

But, as one skilled in the art will appreciate, TCP is a reliableconnection transport protocol that provides a stream of bytes, with noinherent capability to demarcate message boundaries for an upper layerprotocol (ULP). The RDMA Consortium specifications “Direct DataPlacement Over Reliable Transports (Version 1.0)” and “Marker PDUAligned Framing for TCP Specification (Version 1.0),” among other thingsspecifically define techniques for demarcating RDMA message boundariesand for inserting “markers” into a message, or “protocol data unit”(PDU), that is to be transmitted over a TCP transport byte stream sothat an RDMA-enabled network adapter on the receiving end can determineif and when a complete message has been received over the fabric. Aframed PDU (FPDU) can contain 0 or more markers. An FPDU is not amessage per se. Rather, an FPDU is a portion of a ULP payload that isframed with a marker PDU aligned (MPA) header, that has optional MPAmarkers inserted at regular intervals in TCP sequence space, and whichadditionally is padded with up to three octets of zeros (to make thesize of the FPDU an integral multiple of four) and has a 32-bit cyclicredundancy check (CRC) appended thereto. The MPA markers are 32-bits andare inserted at 512 octet intervals in the TCP sequence number space. Agiven MPA marker provides a relative pointer that indicates the numberof octets in the TCP sequence stream from the beginning of acorresponding FPDU to the first octet of the given MPA marker. An MPAheader provides the length of its corresponding PDU and thus, each MPAmarker facilitates location of a corresponding MPA Header, from which areceiver can determine message boundaries for purposes that includecomputation of the 32-bit CRC. A message consists of one or more directdata placement DDP segments, and has the following general types: SendMessage, RDMA Read Request Message, RDMA Read Response Message, and RDMAWrite Message. These techniques are required to enhance the streamingcapability limitation of TCP and must be implemented by any RDMA-enablednetwork adapter.

The present inventors have noted that there are several problemsassociated with implementing an RDMA-enabled network adapter so thatPDUs are reliably handled with acceptable latency over an TCP/IPEthernet fabric. First and foremost, as one skilled in the art willappreciate, TCP does not provide for acknowledgement of messages.Rather, TCP provides for acknowledgement of TCP segments (or partial TCPsegments), many of which may be employed to transmit a message underRDMA over TCP/IP. Yet, the RDMAC Verbs Specification requires that anRDMA-enabled adapter provide message completion information to the verbsuser in the form of Completion Queue Elements (CQEs). And the CQEs aretypically generated using inbound TCP acknowledgements. Thus, it isrequired that an RDMA-enabled network adapter be capable of rapidlydetermining if and when a complete message has been received. Inaddition, the present inventors have noted a requirement for anefficient mechanism to allow for reconstruction and retransmission ofTCP segments under normal network error conditions such as droppedpackets, timeout, and etc. It is furthermore required that a techniquebe provided that allows an RDMA-enabled network adapter to efficientlyrebuild an FPDU (including correct placement of markers therein) underconditions where the maximum segment size (MSS) for transmission overthe network fabric is dynamically changed. The present inventors havealso observed that it is desirable to provide a technique forefficiently inserting message markers into TCP segments that are beingconstructed for transmission and a corresponding technique for removalof markers from received TCP segments

There are additional requirements specified in the above noted RDMAC andIETF specifications that are provided to minimize the number ofintermediate buffer copies associated with TCP/IP operations. Directplacement of data that is received out of order (e.g., partial messagedata) is allowed, but delivery (e.g., “completion”) of messages must beperformed in order. More specifically, a receiver may perform placementof received DDP Segments out of order and it furthermore may performplacement of a DDP Segment more than once. But the receiver must delivercomplete messages only once and the completed messages must be deliveredin the order they were sent. A message is considered completely receivedif and only if the last DDP segment of the message has its last flag set(i.e., a bit indicating that the corresponding DDP segment is the lastDDP segment of the message), all of the DDP segments of the message havebeen previously placed, and all preceding messages have been placed anddelivered.

An RDMA-enabled network adapter can implement these requirements forsome types of RDMA messages by using information that is provideddirectly within the headers of received DDP segments. But the presentinventors have observed that other types of RDMA messages (e.g. RDMARead Response, RDMA Write) do not provide the same type of informationwithin the headers of their respective DDP segments. Consequently, data(i.e., payloads) corresponding to these DDP segments can be directlyplaced in host memory, yet the information provided within theirrespective headers cannot be directly employed to uniquely track orreport message completions in order as required.

Accordingly, the present inventors have noted that it is desirable toprovide apparatus and methods that enable an RDMA-enabled networkadapter to effectively and efficiently track and report completions ofRDMA messages within a protocol suite that allows for out-of-orderplacement of data.

And, as alluded to above, the techniques for demarcating RDMA messageboundaries by providing MPA headers, inserting MPA markers into a PDU,and post-pending the 32-bit MPA CRC allow a receiver to place data thatis received out of order thereby saving a significant amount ofintermediate storage, and additionally overcomes the known limitationsof TCP checksums, which have been shown to indicate errors at a muchhigher rate than underlying link characteristics would suggest.

But, given that TCP is a stream-oriented transport protocol, it ishighly probable that a packet that is received may have anywhere fromzero to approximately 20 MPA markers (depending upon networkcapabilities) embedded therein, and may comprise a partial PDU, acomplete PDU, or a combination of partial and complete PDUs, therebyrendering calculation of the 32-bit MPA CRC difficult at best,particularly at 10 Gb/sec line speeds.

Consequently, the present inventors have noted that it is highlydesirable to provide apparatus and methods that enable an RDMA-enablednetwork adapter to effectively and efficiently perform speculative MPACRC calculations on arriving packets to preclude latencies that wouldotherwise be incurred due to the streaming nature of TCP.

In addition to performing these speculative MPA CRC calculations, it isalso highly desirable to be able to rapidly locate and remove the MPAmarkers from a received packet prior to placing the data in user memory.It is also desirable that location and removal of the MPA markers beaccomplished without requiring the use of additional buffers. It isfurthermore advantageous to quickly locate and insert MPA markers intouser data being provided over a host interface as a packet is beingconstructed for transmission. Insertion of MPA markers into the packetshould also be accomplished without requiring the use of additionalbuffers.

SUMMARY OF THE INVENTION

The present invention, among other applications, is directed to solvingthe above-noted problems and addresses other problems, disadvantages,and limitations of the prior art. The present invention provides asuperior technique for enabling efficient and effectiveinsertion/removal of markers into/from a TCP byte stream that isconfigured to communicate via a network fabric, in one embodiment, anapparatus is provided, for performing a direct memory access (DMA)operation between a host memory in a first server and a network adapter.The apparatus includes a host frame parser and a protocol engine. Thehost frame parser is configured to receive data corresponding to the DMAoperation from a host interface, and is configured to insert markerson-the-fly into the data at a prescribed interval and to provide markeddata for transmission to a second server over a network fabric. Theprotocol engine is coupled to the host frame parser. The protocol engineis configured to direct the host frame parser to insert the markers, andis configured to specify a first marker value and an offset value,whereby the host frame parser is enabled to locate and insert a firstmarker into the data.

One aspect of the present invention contemplates an apparatus, forperforming a direct memory access (DMA) operation between a host memoryin a first server and a network adapter. The apparatus has a host frameparser and a protocol engine. The host frame parser is configured toreceive marked data received from a second server over a network fabric,and is configured to remove markers on-the-fly from the marked data at aprescribed interval, and is configured to provide data corresponding tothe DMA operation to a host interface. The protocol engine is coupled tothe host frame parser. The protocol engine is configured to direct thehost frame parser to remove the markers, and is configured to specify anoffset value, whereby the host frame parser is enabled to locate andremove a first marker from the marked data.

Another aspect of the present invention comprehends a method forperforming a direct memory access (DMA) operation between a host memoryin a first server and a network adapter. The method includes, within ahost frame parser, receiving data corresponding to the DMA operationfrom a host interface, and inserting markers on-the-fly into the data ata prescribed interval, and providing marked data for transmission to asecond server over a network fabric; and directing the host frame parserto insert the markers by specifying a first marker value and an offsetvalue.

A further aspect of the present invention provides for performing adirect memory access (DMA) operation between a host memory in a firstserver and network adapter. The method includes, within a host frameparser, receiving marked data received from a second server over anetwork fabric, and removing markers on-the-fly from the marked data ata prescribed interval, and providing data corresponding to the DMAoperation to a host interface; and directing the host frame parser toremove the markers by specifying an offset value.

BRIEF DESCRIPTION OF THE DRAWINGS

These and other objects, features, and advantages of the presentinvention will become better understood with regard to the followingdescription, and accompanying drawings where:

FIG. 1 is a related art diagram illustrating a typical present day datacenter that provides for a LAN fabric, a SAN fabric, and a clusteringfabric;

FIG. 2 is a block diagram featuring a data center according to thepresent invention that provides a LAN, SAN, and cluster over anRDMA-enabled TCP/IP Ethernet fabric;

FIG. 3 is a block diagram showing a layered protocol for accomplishingremote direct memory access operations according to the presentinvention over a TCP/IP Ethernet fabric;

FIG. 4 is a block diagram depicting placement of an MPA header, MPAmarker, and MPA CRC within an Ethernet frame according to the presentinvention;

FIG. 5 is a block diagram illustrating the interface between a consumerapplication in host memory and a network adapter according to thepresent invention;

FIG. 6 is a block, diagram highlighting how operations occur at selectedlayers noted in FIG. 3 to accomplish movement of data according to thepresent invention between two servers over a TCP/IP Ethernet network;

FIG. 7 is a block diagram of an RDMA-enabled server according to thepresent invention;

FIG. 8 is a block diagram featuring a connection correlator within theRDMA-enabled server of FIG. 7;

FIG. 9 is a block diagram showing details of transmit historyinformation stores within a network adapter according to the presentinvention;

FIG. 10 is a block diagram providing details of an exemplary transmitFIFO buffer entry according to the present invention;

FIG. 11 is a diagram highlighting aspects provided according to thepresent invention that allow for out-of-order placement of received datawhile ensuring that message completions are tracked and reported inorder;

FIG. 12 is a block diagram of an RDMA-enabled server according to thepresent invention featuring mechanisms for performing speculative MPACRC calculations on arriving packets;

FIG. 13 is a block diagram details of a MAC packet parser according tothe present invention;

FIG. 14 is a block diagram of an RDMA-enabled server according to thepresent invention featuring mechanisms for performing on-the-fly MPAmarker insertion and removal; and

FIG. 15 is a block diagram featuring details of the host frame parser ofFIG. 14.

DETAILED DESCRIPTION

The following description is presented to enable one of ordinary skillin the art to make and use the present invention as provided within thecontext of a particular application and its requirements. Variousmodifications to the preferred embodiment will, however, be apparent toone skilled in the art, and the general principles defined herein may beapplied to other embodiments. Therefore, the present invention is notintended to be limited to the particular embodiments shown and describedherein, but is to be accorded the widest scope consistent with theprinciples and novel features herein disclosed.

In view of the above background discussion on protocols that enableremote direct memory access and associated techniques employed withinpresent day systems for accomplishing the offload of TCP/IP operationsfrom a server CPU, a discussion of the present invention will now bepresented with reference to FIGS. 1-15. Use of the present invention 1)permits servers to offload virtually all of the processing associatedwith TCP/IP operations; 2) employs Ethernet as an underlying networkfabric; 3) provides an efficient mechanism for rebuilding andretransmitting TCP segments in the event of network error and forsignaling completion of one or more RDMA operations to a requestingconsumer application; 4) provides for efficient error checking of FPDUsby performing speculative calculations of corresponding MPA CRCs; and 5)provides for in-line insertion and removal of MPA markers required byRDMA-over-TCP protocol specifications.

Now referring to FIG. 1, a related art diagram is presented illustratinga typical present day multi-server configuration 100 within an exemplarydata center that interconnects three servers 101-103 and that providesfor a LAN, a SAN, and a cluster network. The servers 101-103 areinterconnected over the LAN to clients and to network attached storage(NAS) 110 via a LAN fabric that consists of multiple point-to-point LANlinks 112 that are interconnected via, one or more LAN switches 107. Theservers 101-103 each connect up to the LAN via a LAN network adapter104. As alluded to above, virtually all present day LANs utilize TCP/IPover Ethernet as the networking protocol. The servers 101-103 are alsointerconnected over the SAN to one or more block storage devices 111 viaa SAN fabric that consists of multiple point-to-point SAN links 113 thatare interconnected via one or more SAN switches 108. The servers 101-103each connect up to the SAN via a SAN network adapter 105. As is alsonoted above, most present day SANS utilize Fibre Channel as thenetworking protocol. And many installations employ the Small ComputerSystems interface (SCSI) protocol on top of Fibre Channel to enabletransport of data to/from the block storage 111. The servers 101-103 areadditionally interconnected over the cluster network to each other toallow for high performance computing applications as noted above. Thecluster network consists of multiple point-to-point cluster links 114that are interconnected via one or more clustering switches 109. Theservers 101-103 each connect up to the cluster network via a clusternetwork adapter 106. As is also noted above, there is no industrystandard for clustering networks, but companies such as Quadrics Inc,and Myricom produce proprietary cluster network adapters 106, clusteringswitches 109, and links 114 that support high-speed, low latency clusterfabrics.

From a total cost of ownership perspective, one skilled in the art willappreciate that a data center manager must maintain expertise and partsfor three entirely disparate fabrics and must, in addition, field threedifferent network adapters 104-106 for each server 101-103 that is addedto the data center. In addition, one skilled in the art will appreciatethat the servers 101-103 within the data center may very well beembodied as blade servers 101-103 mounted within a blade server rack(not shown) or as integrated server components 101-103 mounted within asingle multi-server blade (not shown). For these, and other alternativedata center configurations, it is evident that the problem ofinterconnecting servers over disparate network fabrics becomes morecomplicated as the level of integration increases.

Add to the above the fact that the underlying network speeds as seen oneach of the links 112-114 is increasing beyond the processingcapabilities of CPUs within the servers 101-103 for conventionalnetworking. As a result, TCP offload techniques have been proposed whichinclude 1) moving the transport processing duties from the CPU down to anetwork adapter; 2) providing a mechanism for remote direct memoryaccess (RDMA) operations, thus giving the network adapter the ability totransfer data directly to/from application memory without requiringmemory copies; and 3) providing a user-level direct access techniquethat allows an application to directly command the network adapter tosend/receive data thereby bypassing the underlying operating system.

As noted in the background the developments associated with INFINIBANDprovided the mechanisms for performing TCP offload and RDMA through theuse of verbs and associated RDMA-enabled network adapters. But theRDMA-enabled network adapters associated with INFINIBAND employedINFINIBAND-specific networking protocols down to the physical layerwhich were not embraced by the networking community.

Yet, the networking community has endeavored to preserve theadvantageous features of INFINIBAND while exploiting the existinginvestments that they have made in TCP/IP infrastructure. As mentionedearlier, the RDMA Consortium has produced standards for performing RDMAoperations over standard TCP/IP networks, and while these standards donot specify a particular physical layer, it is anticipated that Ethernetwill be widely used, most likely 10 Gb Ethernet, primarily because ofthe tremendous base of knowledge of this protocol that is alreadypresent within the community.

The present inventors have noted the need for RDMA over TCP, and havefurthermore recognized the need to provide this capability over Ethernetfabrics. Therefore, the present invention described hereinbelow isprovided to enable effective and efficient RDMA operations over aTCP/IP/Ethernet network.

Now turning to FIG. 2, a block diagram featuring a multi-serverconfiguration 200 within an exemplary data center according to thepresent invention that provides a LAN, SAN, and cluster over anRDMA-enabled TCP/IP Ethernet fabric that interconnects three servers201-203 and that provides for a LAN, a SAN, and a cluster network. Theservers 201-203 are interconnected over the LAN to clients and tonetwork attached storage (NAS) 210 via a LAN fabric that consists ofmultiple point-to-point TCP/IP/Ethernet links 214 that areinterconnected via one or more Ethernet switches 213 (or IP routers213). The servers 201-203 each connect up to the LAN via an RDMA-enablednetwork adapter 212. Like the multi-server configuration 100 of FIG. 1,the configuration 200 of FIG. 2 utilizes TCP/IP over Ethernet as the LANnetworking protocol. In one embodiment, the RDMA-enabled network adapter212 is capable of accelerating a conventional TCP/IP stack and socketsconnection by intercepting a conventional socket SEND command andperforming RDMA operations to complete a requested data transfer. In analternative embodiment, the RDMA-enabled network adapter 212 alsosupports communications via the conventional TCP/IP stack. The servers201-203 are also interconnected over the SAN to one or more blockstorage devices 211 via a SAN fabric that consists of multiplepoint-to-point SAN links 214 that are interconnected via one or moreEthernet switches 213. In contrast to the configuration 100 of FIG. 1,the servers 201-203 each connect up to the SAN via the same RDMA-enablednetwork adapter 212 as is employed to connect up to the LAN. Rather thanusing Fibre Channel as the networking protocol, the SAN employsTCP/IP/Ethernet as the underlying networking protocol and may employInternet SCSI (iSCSI) as an upper layer protocol (ULP) to enabletransport of data to/from the block storage 211. In one embodiment, theRDMA-enabled network adapter 212 is capable of performing RDMAoperations over a TCP/IP/Ethernet fabric responsive to iSCSI commands.The servers 201-203 are additionally interconnected over the clusternetwork to each other to allow for high performance computingapplications as noted above. The cluster network consists of multiplepoint-to-point cluster links 214 that are interconnected via one or moreEthernet switches 213. The servers 201-203 each connect up to the dusternetwork via the same RDMA-enabled network adapter 212 as is used toconnect to the LAN and SAN. For clustering applications, the verbsinterface is used with the RDMA-enabled network adapter 212 over theTCP/IP/Ethernet fabric to enable low latency transfer of data over theclustering network.

Although a separate LAN, SAN, and cluster network are depicted in theRDMA-enabled multi-server configuration 200 according to the presentinvention, the present inventors also contemplate a single fabric overwhich LAN data, SAN data, and cluster network data are commingled andcommonly switched. Various other embodiments are encompassed as well toinclude a commingled LAN and SAN, with a conventional duster networkthat may employ separate switches (not shown) and cluster networkadapters (not shown). In an embodiment that exhibits maximum commonalityand lowest overall cost of ownership, data transactions for LAN, SAN,and cluster traffic are initiated via execution of RDMA over TCP verbsby application programs executing on the servers 201-203, and completionof the transactions are accomplished via the RDMA-enabled networkadapters over the TCP/IP/Ethernet fabric. The present invention alsocontemplates embodiments that do not employ verbs to initiate datatransfers, but which employ the RDMA-enabled adapter to complete thetransfers across the TCP/IP/Ethernet fabric, via RDMA or othermechanisms.

Now turning to FIG. 3, a block diagram 300 is presented showing anexemplary layered protocol for accomplishing remote direct memory accessoperations according to the present invention over a TCP/IP Ethernetfabric. The exemplary layered protocol employs an verbs interface 301,an RDMA protocol layer 302, a direct data placement (DDP) layer 303, amarker PDU alignment layer 304, a conventional TCP layer 305, aconventional IP layer 306, and a conventional Ethernet layer 307.

In operation, a program executing on a server at either the user-levelor kernel level initiates a data transfer operation by executing a verbas defined by a corresponding upper layer protocol (ULP), in oneembodiment, the verbs interface 301 is defined by the aforementioned“RDMA Protocol Verbs Specification,” provided by the RDMA Consortium,and which is hereinafter referred to as the Verbs Specification. TheVerbs Specification refers to an application executing verbs as definedtherein as a “consumer.” The mechanism established for a consumer torequest that a data transfer be performed by an RDMA-enabled networkadapter according to the present invention is known as a queue pair(QP), consisting of a send queue and a receive queue. In addition,completion queue(s) may be associated with the send queue and receivequeue. Queue pairs are typically areas of host memory that are setup,managed, and torn down by privileged resources (e.g., kernel thread)executing on a particular server, and the Verbs Specification describesnumerous verbs which are beyond the scope of the present discussion thatare employed by the privileged resources for management of queue pairs.Once a queue pair is established and assigned, a program operating atthe user privilege level is allowed to bypass the operating system andrequest that data be sent and received by issuing a “work request” to aparticular queue pair. The particular queue pair is associated with acorresponding queue pair that may be executing on a different server, oron the same server, and the RDMA-enabled network adapter accomplishestransfer of data specified by posted work requests via direct memoryaccess (DMA) operations. In a typical embodiment, interface betweenmemory control logic on a server and DMA engines in a correspondingRDMA-enabled network adapter according to the present invention isaccomplished by issuing commands over a bus that supports DMA. In oneembodiment, a PCI-X interface bus is employed to accomplish the DMAoperations. In an alternative embodiment, interface is via a PCI Expressbus. Other host bus protocols are contemplated as well.

Work requests are issued over the verbs interface 301 when a consumerexecutes verbs such as PostSQ (Post Work Request to Send Queue (SQ)) andPostRQ (Post Work Request to Receive Queue (RQ)). Each work request isassigned a work request H) which provides a means for tracking executionand completion. A PostSQ verb is executed to request data send, RDMAread, and RDMA write operations. A PostRQ verb is executed to specify ascatter/gather list that describes how received data is to be placed inhost memory. In addition to the scatter/gather list, a PostRQ verb alsospecifies a handle that identifies a queue pair having a receive queuethat corresponds to the specified scatter/gather list. A Poll forCompletion verb is executed to poll a specified completion queue forindications of completion of previously specified work requests.

The issuance of a work request via the verbs interface by a consumerresults in the creation of a work queue element (WQE) within a specifiedwork queue (WQ) in host memory. Via, an adapter driver and data stores,also in host memory, creation of the WQE is detected and the WQE isprocessed to effect a requested data transfer.

Once a SQ WQE is posted, a data transfer message is created by thenetwork adapter at the RDMAP layer 302 that specifies, among otherthings, the type of requested data transfer (e.g., send, RDMA readrequest, RDMA read response. RDMA write) and message length, ifapplicable. WQEs posted to an RQ do not cause an immediate transfer ofdata. Rather, RQ WQEs are preposted buffers that are waiting for inboundtraffic.

The DDP layer 303 lies between the RDMAP layer 302 and the MPA layer304. Within the DDP layer 303, data from a ULP (i.e., a “DDP message”)is segmented into a series of DDP segments, each containing a header anda payload. The size of the DDP segments is a function of the TCP MaximumSegment Size (MSS), which depends on the IP/link-layer MaximumTransmission Unit (MTU). The header at the DDP layer 303 specifies manythings, the most important of which are fields which allow the directplacement into host memory of each DDP segment, regardless of the orderin TCP sequence space of its arrival. There are two direct placementmodels supported, tagged and untagged. Tagged placement causes the DDPsegment to be placed into a pre-negotiated buffer specified by an STag,field (a type of buffer handle) and TO field (offset into the bufferidentified by the STag field). Tagged placement is typically used withRDMA read and RDMA write messages. Untagged placement causes the DDPsegment to be placed into a buffer that was not pre-negotiated, butinstead was pre-posted by the receiving adapter onto one of severalpossible buffer queues. There are various fields in the DDP segment thatallow the proper pre-posted buffer to be filled, including: a queuenumber that identifies a buffer queue at the receiver (“sink”), amessage sequence number that uniquely identifies each untagged DDPmessage within the scope of its buffer queue number (i.e., it identifieswhich entry on the buffer queue this DDP segment belongs to), and amessage offset that specifies where in the specified buffer queue entryto place this DDP segment. Note that the aforementioned queue number inthe header at the DDP layer 303 does not correspond to the queue pair(QP) that identifies the connection. The DDP header also includes afield (i.e., the last flag) that explicitly defines the end of each DDPmessage.

As noted above, received DDP segments may be placed when received out oforder, but their corresponding messages must be delivered in order tothe ULP. In addition, the fields within untagged RDMA messages (e.g.,queue number, message sequence number, message offset, and the lastflag) allow an RDMA-enabled network adapter to uniquely identify amessage that corresponds to a received DDP segment. This information isneeded to correctly report completions. But observe that tagged RDMAmessages (e.g., RDMA Read Response, RDMA Write) do not provide suchfields. All that are provided for tagged RDMA messages are the STagfield and TO field. Consequently, without additional information, it isimpossible to track and report delivery of untagged RDMA messages inorder to the ULP. The present invention addresses this limitation andprovides apparatus and methods for in-order tracking and delivery ofuntagged RDMA messages, as will be described in further detail below.

The MPA layer 304 is a protocol that frames an upper layer protocol dataunit (PDU) to preserve its message record boundaries when transmittedover a reliable TCP stream and to add message-level error checkingprovisions in the form of a 32-bit MPA CRC. The MPA layer 304 producesframed PDUs (FPDUs). The MPA layer 304 creates an FPDU by pre-pending anMPA header, inserting MPA markers into the PDU at 512 octet periodicintervals in TCP sequence number space if required, post-pending a padset to zeros to the PDU to make the size of the FPDU an integralmultiple of four, and adding the aforementioned 32-bit cyclic redundancycheck (CRC) that is used to verify the contents of the FPDU. The MPAheader is a 16-bit value that indicates the number of octets in thecontained PDU. The MPA marker includes a 16-bit relative pointer thatindicates the number of octets in the TCP stream from the beginning ofthe FPDU to the first octet of the MPA marker. MPA markers are providedto allow for placement of data that is received out of order. Becausethe MPA markers occur in the TCP byte stream at regular intervals, areceiving RDMA-enabled network adapter is provided with a means forlocating the MPA header, and thus is enabled to determine when a messagehas been completely received.

FPDUs are provided to the conventional TCP layer 305, which provides forreliable transmission of a stream of bytes over the establishedconnection. This layer 305 divides FPDUs into TCP segments and prependsa TCP header which indicates source and destination TCP ports along witha TCP segment octet sequence number. In other words, the TCP segmentoctet sequence number is not a count of TCP segments; it is a count ofoctets transferred.

TCP segments are passed to the IP layer 306. The IP layer 306encapsulates the TCP segments into IP datagrams having a header thatindicates source and destination IP addresses.

Finally, the IP datagrams are passed to the Ethernet layer 307, whichencapsulates the IP datagrams into Ethernet frames, assigning a sourceand destination media access control (MAC) address to each, andpost-pending a CRC to each frame.

One skilled in the art will appreciate that layers 305-307 representconventional transmission of a stream of data over a reliableTCP/IP/Ethernet connection. Framing for preservation of ULPDU boundariesis provided for by the MPA layer 304. And direct placement of data viaDMA is handled by an RDMA-enabled network adapter according to thepresent invention in accordance with verbs interface 301 and layers302-303 as they interact with a consumer through an established workqueue. It is noted that the information pre-pended and inserted bylayers 302-304 is essential to determining when transmission of dataassociated with an RDMA operation (e.g., send, RDMA read, RDMA write) iscomplete. An RDMA-enabled network adapter that is employed in anypractical implementation, to include LANs, SANs, and clusters thatutilizes 10 Gb links must be capable of making such determination andmust furthermore be capable of handling retransmission of TCP segmentsin the case of errors with minimum latency. One skilled in the art willappreciate that since the boundaries of an RDMA message are derived fromparameters stored in a Work Queue in host memory, the host memorytypically must be accessed in order to determine these boundaries. Thepresent inventors recognize this unacceptable limitation of present dayconfigurations and have provided, as will be described in more detailbelow, apparatus and methods for maintaining a local subset of theparameters provided in a work queue that are essential forretransmission in the event of network errors and for determining when arequested RDMA operation has been completed so that a completion queueentry can be posted in a corresponding completion queue.

The present inventors also have observed that there are a number ofproblems associated with the placement and removal of MPA markers withina TCP byte stream which must be overcome in order for an RDMA-enablednetwork adapter to efficiently operate at speeds commensurate with 10Gb/sec Ethernet links. For example, as will be addressed in more detailbelow, it is appreciated that TCP is a byte stream protocol which is notrequired to preserve TCP segment boundaries. Rather, TCP allows forresegmentation of a TCP segment into a plurality of TCP segments, andalso allows for resegmentation of a TCP segment into fewer TCP segments.Such resegmentation consequently may result in TCP segments that are notaligned upon PDU boundaries, as would be desirable from a processingperspective, particularly with regard to the placement and removal ofMPA markers. Consequently, the present inventors have observed that anRDMA-enabled network adapter must be capable of functioning efficientlyunder the above-noted conditions, particularly where a ULP PDU isreceived in more than one TCP segment and where the PDU header does not,immediately follow the TCP header. Furthermore, the present inventorshave noted that an RDMA-enabled network adapter must also be capable ofefficiently processing multiple ULP PDUs that have been combined into asingle TCP segment.

Now referring to FIG. 4, a block diagram is presented depictingplacement of an MPA header 404, MPA marker 406, and MPA CRC 409 withinan Ethernet frame 400 according to the present invention. As noted inthe discussion above with reference to FIG. 3, the DDP layer 303 passesdown a PDU to the MPA layer 304, where the PDU consists of a DDP headerand DDP payload. The MPA layer 304 adds an MPA header 404 to the PDUindicating its length and is also required to insert an MPA marker 406every 512 octets in the TCP sequence space that includes a 16-bitrelative pointer that indicates the number of octets in the TCP streamfrom the beginning of the FPDU to the first octet of the MPA marker 406.Thus, the example of FIG. 4 shows an MPA marker 406 inserted within asingle PDU, thus dividing the PDU into two parts: a first part PDU.1 405prior to the marker 406, and a second part PDU.2 407 following themarker 406. In addition, the MPA layer 304 appends an MPA pad 408 andMPA CRC 409 as described above to form an FPDU comprising items 404-409.The TCP layer 305 adds a TCP header as described above to form a TCPsegment comprising fields 403-409. The IP layer 306 adds an IP header402 as described above to form an IP datagram comprising fields 402-409.And finally, the Ethernet layer adds an Ethernet header 401 and EthernetCRC 410 to form an Ethernet frame 400 comprising fields 401-410.

According to the protocol specifications noted above, the MPA marker 406points some number of octets within a given TCP stream back to an octetwhich is designated as the beginning octet of an associated FPDU. If themaximum segment size (MSS) for transmission over the network is changeddue to error or due to dynamic reconfiguration, and if an RDMA-enabledadapter is required to retransmit a portion of TCP segments wing thischanged MSS, the RDMA-enabled network adapter must rebuild or otherwiserecreate all of the headers and markers within an FPDU so that they arein the exact same places in the TCP sequence space as they were in theoriginal FPDU which was transmitted prior to reconfiguration of thenetwork. This requires at least two pieces of information: the newchanged MSS and the MSS in effect when the FPDU was first transmitted.An MSS change will cause the adapter to start creating never-transmittedsegments using the new MSS. In addition, the adapter must rebuildpreviously transmitted PDUs if it is triggered to do so, for example,by, a transport timeout. In addition to parameters required to correctlyrecreate MPA FPDUs, one skilled in the art will appreciate that otherparameters essential for rebuilding a PDU include the message sequencenumber (e.g., Send MSN and/or Read MSN) assigned by the DDP layer 303,the starting TCP sequence number for the PDU, and the final TCP sequencenumber for the PDU. Most conventional schemes for performingretransmission maintain a retransmission queue which contains parametersassociated with PDUs that have been transmitted by a TCP/IP stack, butwhich have not been acknowledged. The queue is typically embodied as alinked list and when retransmission is required, the linked list must bescanned to determine what portion of the PDUs are to be retransmitted. Atypical linked list is very long and consists of many entries. This isbecause each of the entries corresponds to an Ethernet packet.Furthermore, the linked list must be scanned in order to processacknowledged TCP segments for purposes of generating completion queueentries. In addition, for RDMA over TCP operations, the specificationsrequire that completion queue entries be developed on a message basis.And because TCP is a streaming protocol, the data that is required todetermine message completions must be obtained from the upper layers301-304. The present inventors have noted that such an implementation isdisadvantageous as Ethernet speeds are approaching 10 Gb/second becauseof the latencies associated with either accessing a work queue elementin host memory over a PCI bus or because of the latencies associatedwith scanning a very long linked list. In contrast, the presentinvention provides a superior technique for tracking information forprocessing of retransmissions and completions at the message level (asopposed to packet-level), thereby eliminating the latencies associatedwith scanning very long linked lists.

In addition to the above-noted challenges, the present inventors havealso observed other challenges that must be overcome when implementing amulti-gigabit network transport layer according to the protocolconventions of FIG. 4. One such difficulty, as alluded to above, isproviding an efficient and effective mechanism for the location,placement, and removal of MPA markers under 10 Gb/sec link conditions.For a 1460-byte TCP segment, two or three MPA markers must be insertedor removed. But for a 9K jumbo packet, there could be approximately 18markers that must be inserted or removed. Consequently, astraightforward solution which performs a sequence of copy operationsfrom one buffer to a next buffer within an adapter to insert/remove MPAmarker is unacceptable at 10 Gb/sec link speeds because of the latenciesand performance issues that are associated with the copy operations. Avariation on the buffer technique above would eliminate an intermediateset of internal buffers in the adapter and instead perform the copyoperations directly to host memory. That is, once the adapter hascompleted ULP protocol processing on a received packet to locate headersand validate the packet, it would perform a series of 508-byte writeoperations to host memory to place the data without markers. Similarly,508-byte read operations would be required to retrieve the data frommemory and place MPA markers therein before storing the data to internalbuffers within the adapter. But, as one skilled in the art willappreciate, approximately 19 506-byte read requests would be requiredjust to build one 9K jumbo packet. Issuing such a large number of readrequests just to build one packet is limiting because of the issuesassociated with processing a large number of read responses that may bereceived out of order, the limitations of today's server chipsets (mostdo not support up to 19 outstanding read requests), and the memorytransfer inefficiencies that arise from providing 508-byte requests tomemory controllers that are optimized for 64-byte cache line quantizedtransfers. Clearly, MPA marker insertion and removal is an issue thatmust be addressed when operating an RDMA-enabled network adapter over 10Gb/sec links. And the present invention addresses these issues, andlimitations of the present state of the art, as will be described infurther detail below.

A further challenge involves the difficulty associated with calculationand validation of the MPA CRC 409. The diagram of FIG. 4 depicts what isknown as an “aligned” FPDU within the Ethernet frame 400. The FPDU isaligned because the PDU length field 404 (also called an MPA header 404)immediately follows the TCP header 403 and the MPA CRC field 409 iswithin the same frame 400 as the PDU to which it corresponds. Such aconfiguration is highly desirable from the standpoint of an RDMA-enablednetwork for purposes of computing a CRC of the corresponding FPDUbecause all of the information (i.e. the MPA header and MPA CRC) that isrequired for computation of the CRC is resident within the receivedframe 400 itself. Because the PDU is aligned within, the received frame400, an RDMA-enabled network adapter can immediately locate the lengthof the PDU 404 (it directly follows the TCP header 403), and from thelength field 404, the adapter can determine the TCP sequence number ofthe MPA CRC field 409. Thus, the adapter can calculate a running CRC ofthe FPDU within the frame 400 for comparison therewith. The state (i.e.,the location within TCP sequence space of MPA markers 406, which allowsdetermination of the starting TCP sequence number of the FPDU) isrequired in order to recognize PDU boundaries within a TCP byte stream,and to enable PDUs that can span multiple TCP segments. And because anypractical adapter must support a number of TCP connections, the statemust be maintained for each one of the TCP connections. In addition, tosupport optimal performance of the adapter, the state information mustbe available in real-time as TCP segments arrive. Yet, providing thestate for a number of TCP connections in real-time state availabilitycan be very challenging at high link speeds, due in part to the factthat correlating an inbound TCP segment to its connection number canrequire complex and time consuming pattern matching, which can keepstate information from being known in time to start a CRC calculation.The present inventors have further noted that it would be advantageousfrom a performance perspective to perform MPA CRC checks while receivinga PDU so a separate pass through the data would not otherwise berequired and additional latency would not be added to PDU processing.The present invention contemplates an RDMA-enabled network adapter withMPA CRC capabilities which meets these requirements.

In more particular terms, in order to perform ULP CRC calculations(e.g., FPDU CRCs) on data which is received over a byte stream transportlike TCP, it is required to have access to various state variables suchas the starting octet (e.g., TCP sequence number) of an FPDU and thelocation within TCP sequence space of MPA markers 406 in order tovalidate a corresponding MPA CRC 409. But, as one skilled in the artwill agree, TCP is a byte stream oriented protocol which is not requiredto preserve the TCP segment boundaries. For example, it is allowablewithin TCP to combine TCP segments in order to improve bandwidthutilization of a connection. By combining TCP segments, bandwidth isimproved because there are fewer Ethernet 401, IP 402, and TCP headers403. In addition, it is also permissible to resegment a TCP segment,that is, to break a single TCP segment up into two or more TCP segments.Consequently, while aligned FPDUs are desired by a ULP such as MPA,because combination and resegmentation are allowed under TCP, the resultoften is unaligned FPDUs that are received, which are difficult toprocess in terms of CRC computations for purposes of validating a ULPCRC. This is because the aforementioned state information (i.e., thelocation within TCP sequence space of MPA markers 406, which allowsdetermination of the starting TCP sequence number of the FPDU) is notknown when a packet is received.

Yet, an RDMA-enabled network adapter must be able to compute andvalidate CRCs for the case where a ULP PDU is segmented, and thusarrives in more than one TCP segment. In addition, the RDMA-enablednetwork adapter must also be able to compute and validate CRCs for thecase where TCP has combined smaller ULP PDUs into a single TCP segment.This packing of ULP PDUs into a single TCP segment further complicatesthe CRC validation process because multiple checks need to now beperformed per TCP segment. All of these factors complicate performingMPA CRC checks as TCP segments arrive. The present invention addressesthese issues and furthermore provides a mechanism for speculativelycomputing ULP CRCs based upon the premise that it is highly probable toreceive aligned FPDUs. Accordingly, the present invention presumes thatall received frames 400 contained aligned FPDUs therein. Thus, thepresent invention provides for calculation and validation of MPA CRCs atthe frame level, conditioned upon the actual configuration of the frame400. Three different speculative CRCs are calculated as the frame isreceived: one CRC presumes MPA markers 406 are not enabled on theconnection, another CRC presumes a minimum number of markers 406 arepresent within the frame 400, and a third CRC presumes a maximum numberof markers 406 are present within the frame 400. The speculative CRCsare computed concurrent with receipt of the frame 400. If laterprocessing of the FPDU determines that the frame 400 is indeed aligned,then an appropriate one of the CRCs is employed to validate the MPA CRC409. If later processing indicates that the frame 400 is not aligned (asa result of segment combining, resegmentation, or other causes), thenthe speculative CRCs are discarded and an actual CRC is generated andvalidated once the entire FPDU has been received, thus adding latency tothe flow. However, the probable case is that FPDUs will be aligned, andby generating these speculative CRCs and validating MPA CRCs based upontheir presumed location in a received frame 400, the present inventioneliminates most of the latencies associated with MPA CRC error checksthat would otherwise be incurred in an RDMA-enabled network adapter.

To further illustrate features and advantages of the present invention,attention is now directed to FIG. 5, which is a block diagram 500illustrating interface between a consumer application 502 in host memory501 and an RDMA-enabled network adapter 505 according to the presentinvention. The block diagram 500 illustrates the employment of workqueues 506 according to the present invention disposed within adapterdriver/data stores 512 to support RDMA over TCP operations. The adapterdriver/data stores 512 is disposed within the host memory 501 andmaintains the work queues 506 and provides for communication with thenetwork adapter 505 via adapter interface logic 511. A work queue 506 iseither a send queue or a receive queue. As alluded to above in thediscussion with reference to FIG. 3, a work queue 506 is the mechanismthrough which a consumer application 502 provides instructions thatcause data to be transferred between the application's memory andanother application's memory. The diagram 500 depicts a consumer 502within host memory 501. A consumer 502 may have one or morecorresponding work queues 506, with a corresponding completion queue508. Completion queues 508 may be shared between work queues 506. Forclarity, the diagram 500 depicts only the send queue (SQ) portion 506 ofa work queue pair that consists of both a send queue 506 and a receivequeue (not shown). The completion queue 508 is the mechanism throughwhich a consumer 502 receives confirmation that the requested RDMA overTCP operations have been accomplished and, as alluded to above,completion of the requested operations must be reported in the orderthat they were requested. Transaction logic 510 within the networkadapter 505 is coupled to each of the work queues 506 and the completionqueue 508 via the adapter driver logic 511.

The present inventors note that the network adapter 505 according to thepresent invention can be embodied as a plug-in module, one or moreintegrated circuits disposed on a blade server, or as circuits within amemory hub/controller. It is further noted that the present inventioncomprehends a network adapter 505 having work queues 506 disposed inhost memory 501 and having transaction logic 510 coupled to the hostmemory 501 via a host interface such as PCI-X or PCI-Express. It ismoreover noted that the present invention comprehends a network adapter505 comprising numerous work queue pairs. In one embodiment, the networkadapter 505 comprises a maximum of 256K work queue pairs.

RDMA over TCP operations are invoked by a consumer 502 through thegeneration of a work request 503. The consumer 502 receives confirmationthat an RDMA over TCP operation has been completed by receipt of a workcompletion 504. Work requests 503 and work completions 504 are generatedand received via the execution of verbs as described in the above notedVerb Specification. Verbs are analogous to socket calls that areexecuted in a TCP/IP-based architecture. To direct the transfer of datafrom consumer memory 501, the consumer 502 executes a work request verbthat causes a work request 503 to be provided to the adapter driver/datastores 512. The adapter driver/data stores 512 receives the work request503 and places a corresponding work queue element 507 within the workqueue 506 that is designated by the work request 503. The adapterinterface logic 511 communicates with the network adapter 505 to causethe requested work to be initiated. The transaction logic 510 executeswork queue elements 507 in the order that they are provided to a workqueue 506 resulting in transactions over the TCP/IP/Ethernet fabric (notshown) to accomplish the requested operations. As operations arecompleted, the transaction logic 510 places completion queue elements509 on completion queues 508 that correspond to the completedoperations. The completion queue elements 509 are thus provided tocorresponding consumers 502 in the form of a work completion 504 throughthe verbs interface. It is furthermore noted that a work completion 504can only be generated after TCP acknowledgement of the last byte withinTCP sequence space corresponding to the given RDMA operation has beenreceived by the network adapter 505.

FIG. 5 provides a high-level representation of queue structures 506, 508corresponding to the present invention to illustrate how RDMA over TCPoperations are performed from the point of view of a consumerapplication 502. At a more detailed level, FIG. 6 is presented tohighlight how operations occur at selected layers noted in FIG. 3 toaccomplish movement of data according to the present invention betweentwo servers over a TCP/IP Ethernet network.

Turning to FIG. 6, a block diagram 600 is presented showing twoconsumers 610, 650 communicating over an RDMA-enabled TCP/IP/Ethernetinterface. The diagram 600 shows a first consumer application 610coupled to a first networking apparatus 611 within a first serveraccording to the present invention that is interfaced over anRDMA-enabled TCP/IP/Ethernet fabric to a counterpart second consumerapplication 650 coupled to a second networking apparatus 651 within asecond server according to the present invention. The first consumer 610issues work requests and receives work completions to/from the firstnetworking apparatus 611. The second consumer 650 issues work requestsand receives work completions to/from the second networking apparatus651. For the accomplishment of RDMA over TCP operations between the twoconsumers 610, 650, each of the networking apparatuses 611, 651 haveestablished a corresponding set of work queue pairs 613, 653 throughwhich work queue elements 615, 617, 655, 657 will be generated totransfer data to/from first host memory in the first server from/tosecond host memory in the second server in the form of RDMA messages691. Each of the work queue pairs 613, 653 has a send queue 614, 654 anda receive queue 616, 656. The send queues 614, 654 contain send queueelements 615, 655 that direct RDMA over TCP operations to be transactedwith the corresponding work queue pair 653, 613. The receive queues 616,656 contain receive queue elements 617, 657 that specify memorylocations (e.g., scatter/gather lists) to which data received from acorresponding consumer 610, 650 is stored. Each of the networkingapparatuses 611, 651 provide work completions to their respectiveconsumers 610, 650 via one or more completion queues 618, 658. The workcompletions are provided as completion queue elements 619, 659. Each ofthe work queue pairs 613, 653 within the networking apparatuses 611, 651are interfaced to respective transaction logic 612, 652 within anRDMA-enabled network adapter 622, 662 according to the presentinvention. The transaction logic 612, 652 processes the work queueelements 615, 617, 655, 657. For send queue work queue elements 615, 655that direct transmission of PDUs 681, the transaction logic 612, 652generates PDUs 681, lower level FPDUs, TCP segments 671, IP datagrams(or “packets”), and Ethernet frames, and provides the frames to acorresponding Ethernet port 620, 660 on the network adapter 622, 662.The ports 620, 660 transmit the frames over a corresponding Ethernetlink 621. It is noted that any number of switches (not shown), routers(not shown), and Ethernet links 621 may be embodied as shown by thesingle Ethernet link 621 to accomplish routing of packets in accordancewith the timing and latency requirements of the given network.

In an architectural sense. FIG. 6 depicts how all layers of an RDMA overTCP operation according to the present invention are provided for byRDMA-aware consumers 610, 650 and networking apparatus 611, 651according to the present invention. This is in stark contrast to aconvention TCP/IP stack that relies exclusively on the processingresources of a server's CPU. Ethernet frames are transmitted overEthernet links 621. Data link layer processing is accomplished via ports620, 610 within the network adapters 622, 662. Transaction logic 612,652 ensures that IP packets are routed (i.e., network layer) to theirproper destination node and that TCP segments 671 are reliablydelivered. In addition, the transaction logic 612, 652 ensuresend-to-end reliable delivery of PDUs 681 and the consumers 610, 650 arenotified of successful delivery through the employment of associatedcompletion queues 618, 658. Operations directed in corresponding workqueues 613, 653 result in data being moved to/from the host memories ofthe consumer applications 610, 650 connected via their correspondingqueue pairs 613, 653.

Referring to FIG. 7, a block diagram is presented of an RDMA-enabledserver 700 according to the present invention. The server 700 has one ormore CPUs 701 that are coupled to a memory hub 702. The memory hub 702couples CPUs and direct memory access (DMA)-capable devices to hostmemory 703 (also known as system memory 703). An RDMA-enabled networkadapter driver 719 is disposed within the host memory. The driver 719provides for control, of and interface to an RDMA-enabled networkadapter 705 according to the present invention. The memory hub 702 isalso referred to as a memory controller 702 or chipset 702.Commands/responses are provided to/from the memory hub 702 via a hostinterface 720, including commands to control/manage the network adapter705 and DMA commands/responses. In one embodiment, the host interface720 is a PCI-X bus 720. In an alternative embodiment, the host interface720 is a PCI Express link 720. Other types of host interfaces 720 arecontemplated as well, provided they allow for rapid transfer of datato/from host memory 703. An optional hub interface 704 is depicted andit is noted that the present invention contemplates that such aninterface 704 may be integrated into the memory hub 702 itself, that thehub interface 704 and memory hub 702 may be integrated into one or moreof the CPUs 701. It is noted that the term “server” 700 is employedaccording to the present invention to connote a computer 700 comprisingone or more CPUs 701 that are coupled to a memory hub 702. The server700 according to the present invention is not to be restricted tomeanings typically associated with computers that run serverapplications and which are typically located within a data center,although such embodiments of the present invention are clearlycontemplated. But in addition, the server 700 according to the presentinvention also comprehends a computer 700 having one or more CPUs 701that are coupled to a memory hub 702, which may comprise a desktopcomputer 700 or workstation 700, that is, computers 700 which arelocated outside of a data center and which may be executing clientapplications as well.

The network adapter 705 has host interface logic 706 that provides forcommunication to the memory hub 702 and to the driver 719 according tothe protocol of the host interface 720. The network adapter 705 also hastransaction logic 707 that communicates with the memory hub 702 anddriver 719 via, the host interface logic. The transaction logic 707 isalso coupled to one or more media access controllers (MAC) 712. In oneembodiment, there are four MACs 712. In one embodiment, each of the MACs712 is coupled to a serializer/deserializer (SERDES) 714, and each ofthe SERDES 714 are coupled to a port that comprises respective receive(RX) port 715 and respective transmit (TX) port 716. Alternativeembodiments contemplate a network adapter 705 that does not includeintegrated SERDES 714 and ports. In one embodiment, each of the portsprovides for communication of frames in accordance with 1 Gb/secEthernet standards. In an alternative embodiment, each of the portsprovides for communication of frames in accordance with 10 Gb/secEthernet standards. In a further embodiment, one or more of the portsprovides for communication of frames in accordance with 10 Gb/secEthernet standards, while the remaining ports provide for communicationof frames in accordance with 1 Gb/sec Ethernet standards. Otherprotocols for transmission of frames are contemplated as well, toinclude Asynchronous Transfer Mode (ATM).

The transaction logic 707 includes a transaction switch 709 that iscoupled to a protocol engine 708, to transmit history information stores710, and to each of the MACs 712. The protocol engine includesretransmit/completion logic 717. The protocol engine is additionallycoupled to IP address logic 711 and to the transmit history informationstores 710. The IP address logic 711 is coupled also to each of the MACs712. In addition, the transaction switch 709 includes connectioncorrelation logic 718.

In operation, when a CPU 701 executes a verb as described herein toinitiate a data transfer from the host memory 703 in the server 700 tosecond host memory (not shown) in a second device (not shown), thedriver 719 is called to accomplish the data transfer. As alluded toabove, it is assumed that privileged resources (not shown) haveheretofore set up and allocated a work queue within the host memory 703for the noted connection. Thus execution of the verb specifies theassigned work queue and furthermore provides a work request for transferof the data that is entered as a work queue element into the assignedwork queue as has been described with reference to FIGS. 5-6.Establishment of the work queue entry into the work queue triggers thedriver 719 to direct the network adapter 705 via the host interface 720to perform the requested data transfer. Information specified by thework queue element to include a work request ID, a steering tag (ifapplicable), a scatter/gather list (if applicable), and an operationtype (e.g., send, RDMA read, RDMA write), along with the work queuenumber, are provided over the host interface 720 to the transactionlogic 707. The above noted parameters are provided to the protocolengine 708, which schedules for execution the operations required toeffect the data transfer through a transmit pipeline (not shown)therein. The protocol engine 708 schedules the work required to effectthe data transfer, and in addition fills out an entry (not shown) in acorresponding transmit FIFO buffer (not shown) that is part of thetransmit history information stores 710. The corresponding FIFO bufferis dynamically bound to the work queue which requested the data transferand every bound FIFO buffer provides entries corresponding one-to-onewith the entries in the work queue to which it is dynamically bound. Inone embodiment, the transmit FIFO buffer is embodied as a memory that islocal to the network adapter 705. Dynamic binding of FIFO buffers towork queues according to the present invention is extremely advantageousfrom the standpoint of efficient utilization of resources. For example,consider an embodiment comprising a 16 KB FIFO buffer. In aconfiguration that supports, say, 4K queue pairs, if dynamic bindingwere not present, then 64 MB of space would be required to provide forall of the queue pairs. But, as one skilled in the art will appreciate,it is not probable that all queue pairs will be transmittingsimultaneously, so that a considerable reduction in logic is enabled byimplementing dynamic binding. Upon allocation of the entry in thetransmit FIFO buffer, parameters from the work queue element are copiedthereto and maintained to provide for effective determination ofcompletion of the data transfer and for rebuilding/retransmission of TCPsegments in the event of network errors or dynamic reconfiguration.These parameters include, but are not limited to the work request ID andthe steering tag. To effect the data transfer, the data specified in thework queue element is fetched to the network adapter 705 using DMAoperations to host memory 703 via the host interface 720 to the memorycontroller 702. The data is provided to the transaction switch 709. Theprotocol engine 708 in conjunction with the transaction switch 709generates all of the header, marker, CRC, and checksum fields describedhereinabove for respective layers of the RDMA over TCP protocol and whenPDUs, FPDUs, TCP segments, and IP datagrams are generated, parametersthat are essential to a timely rebuild of the PDUs (e.g., MULPDU, themessage sequence number, the starting and final TCP sequence numbers)are provided to the transmit history information stores 710 in theallocated entry in the transmit. FIFO buffer. In one embodiment, theconnection correlation logic 718 within the transaction switch 709, foroutgoing transmissions, provides an association (or “mapping”) for awork queue number to a “quad.” The quad includes TCP/IP routingparameters that include a source TCP port, destination. TCP port, asource IP address, and a destination IP address. Each queue pair has anassociated connection context that directly defines all four of theabove noted parameters to be used in outgoing packet transmissions.These routing parameters are employed to generate respective TCP and IPheaders for transmission over the Ethernet fabric. In an alternativeembodiment, the connection correlation logic 718, for outgoingtransmissions, is disposed within the protocol engine 708 and employs IPaddresses stored within the IP address logic 711. The Ethernet framesare provided by the transaction switch 709 to a selected MAC 712 fortransmission over the Ethernet fabric. The configured Ethernet framesare provided to the SERDES 714 corresponding to the selected MAC 712.The SERDES 714 converts the Ethernet frames into physical symbols thatare sent out to the link through the TX port 716. For inbound packets,the connection correlation logic 718 is disposed within the transactionswitch 709 and provides a mapping of an inbound quad to a work queuenumber, which identifies the queue pair that is associated with theinbound data.

The IP address logic 711 contains a plurality of entries that are usedas source IP addresses in transmitted messages, as alluded to above, inone embodiment, there are 32 entries. In addition, when an inbounddatagram is received correctly through one of the MACs 712, thedestination IP address of the datagram is compared to entries in the LPaddress logic 711. Only those destination IP addresses that match anentry in the IP address logic 711 are allowed to proceed further in theprocessing pipeline associated with RDMA-accelerated connections. Asnoted above, other embodiments of the present invention are contemplatedthat include use of an RDMA-enabled network adapter 705 to also processTCP/IP transactions using a conventional TCP/IP network stack in hostmemory. According to these embodiments, if an inbound packet'sdestination IP address does not match an entry in the IP address logic711, then the packet is processed and delivered to the host according tothe associated network protocol.

The protocol engine 708 includes retransmit/completion logic 717 thatmonitors acknowledgement of TCP segments which have been transmittedover the Ethernet fabric. If network errors occur which require that oneor more segments be retransmitted, then the retransmit/completion logic717 accesses the entry or entries in the corresponding transmit FIFObuffer to obtain the parameters that are required to rebuild andretransmit the TCP segments. The retransmitted TCP segments may consistof a partial FPDU under conditions where maximum segment size has beendynamically changed. It is noted that all of the parameters that arerequired to rebuild TCP segments associated for retransmission arestored in the associated transmit FIFO buffer entries in the transmithistory information stores 710.

Furthermore, a final TCP sequence number for each generated message isstored in the entry so that when the final TCP sequence number has beenacknowledged, then the protocol engine 708 will write a completion queueentry (if required) to a completion queue in host memory 703 thatcorresponds to the work queue element that directed the data transfer.

It is also noted that certain applications executing within the sameserver 700 may employ RDMA over TCP operations to transfer data. Assuch, the present invention also contemplates mechanisms wherebyloopback within the transaction logic 707 is provided for along withcorresponding completion acknowledgement via the parameters stored bythe transmit history information stores 710.

Now turning to FIG. 8, a block diagram is presented featuring anexemplary connection correlator 800 within the RDMA-enabled server 700of FIG. 7. The block diagram shows a work queue-to-TCP map 803 and aTCP-to-work queue map 801. The TCP-to-work queue map 801 has one or moreentries 802 that associate a “quad” retrieved from inbound IP datagramswith a corresponding work queue number. A quad consists of source anddestination IP addresses and source and destination TCP ports. Thus,correlation between a quad and a work queue number, establishes avirtual connection between two RDMA-enabled devices. Thus, the payloadsof received datagrams are mapped for processing and eventual transfer toan associated area of memory that is specified by a work queue elementwithin the selected work queue number 802.

For outbound datagrams, the work queue-to-TCP map 803 has one or moreentries 804, 805 that associate a work queue number with a correspondingquad that is to be employed when configuring the outbound datagrams.Accordingly, the outbound datagrams for associated FPDUs of a given workqueue number are constructed using the selected quad.

The exemplary connection correlator 800 of FIG. 8 is provided to clearlyteach correlation aspects of the present invention, and the presentinventors note that implementation of the correlator 800 as a simpleindexed table in memory as shown is quite impractical. Rather, in oneembodiment, the TCP-to-work queue map 801 is disposed within a hashed,indexed, and linked list structure that is substantially similar infunction to content addressable memory.

Referring to FIG. 9, a block diagram is presented showing details oftransmit history information stores 900 within a network adapteraccording to the present invention. The transmit history information,stores 900 includes entry access logic 902 that is coupled to aplurality of transmit FIFO buffers 903. Each of the buffers 903 includesone or more entries 904 which are filled out by a protocol engineaccording to the present invention while processing work queue elementsrequiring transmission of data over the Ethernet fabric. In oneembodiment, the transmit history information, stores 900 is a memorythat is integrated within a network adapter according to the presentinvention. In an alternative embodiment, the transmit historyinformation stores 900 is a memory that is accessed over a local memorybus (not shown). In this alternative embodiment, optional interfacelogic 901 provides for coupling of the entry access logic 902 to thelocal memory bus. In one embodiment, each buffer 903 comprises 16Kilobytes which are dynamically bound to a queue pair when send queueelements exist on that pair for which there are to-be-transmitted orunacknowledged TCP segments. Each buffer 903 is temporarily hound to aqueue pair as previously noted and each entry 904 is affiliated with awork queue element on the queue pair's send queue. In one embodiment,each buffer entry 904 comprises 32 bytes.

Now turning to FIG. 10, a block diagram is presented providing detailsof an exemplary transmit FIFO butter entry 1000 according to the presentinvention. The buffer entry includes the following fields: sendmsn 1001,readmsn 1002, startseqnum 1003, finalseqnum 1004, streammode 1005,sackpres 1006, mulpdu 1007 notifyoncomp 1008, stagtoinval 1009,workreqidlw 1010, workreqidhi 1011, and type 1012. The sendmsn field1001 maintains the current 32-bit send message sequence number. Thereadmsn field 1002 maintains the current 32-bit read message sequencenumber. The startseqnum field 1003 maintains the initial TCP sequencenumber of the send queue element affiliated with the entry 1000 Thestartseqnum field 1003 is provided to the entry 1000 during creation ofthe first TCP segment of the message. The finalseqnum field 1004maintains the final TCP sequence number of the message. The finalseqnumfield 1004 is provided during creation of the of the first TCP segmentof a message corresponding to a TCP offload engine (TOE) connection. Foran RDMA message, the finalseqnum field 1004 is created when a DDPsegment containing a last flag is sent. The streammode field 1005maintains a 1-bit indication that TCP streaming mode is being employedto perform data transactions other than RDMA over TCP, for example, aTCP-offload operation. The sackpres field 1006 maintains a 1-bitindication that the mulpdu field 1007 has been reduced by allocation fora maximum sized SACK block. The mulpdu field 1007 maintains a size ofthe maximum upper level PDU that was in effect at the time of transmit.This field 1007 is used when TCP segments are being rebuilt in the eventof network errors to re-segment FPDUs so that they can be reliablyreceived by a counterpart network adapter. The notifyoncomp field 1008indicates whether a completion queue element needs to be generated bythe network adapter for the associated work queue element when all,outstanding TCP segments of the message have been acknowledged. Thestagtoinval field 1009 maintains a 32-bit steering tag associated withan RDMA Read Request with Local invalidate option. The workreqidlowfield 1010 and workreqidhi field 1011 together maintain the work requestID provided by the work queue element on the corresponding send queue.These fields 1010-1011 are used to post a completion queue event. Thetype field 1012 is maintained to identify the type of operation that isbeing requested by the send queue element including send. RDMA read, andRDMA write.

As is noted earlier, the specifications governing RDMA over TCP/IPtransactions allow for out-of-order placement of received DDP segments,but require that all RDMA messages be completed in order. Furthermore,DDP segments corresponding to untagged RDMA messages have within theirrespective DDP headers all the information that is required to uniquelyidentify which specific RDMA message a DDP segment belongs to, whichtells the receiving adapter which work queue entry is affiliated withthe DDP segment. The receiving adapter needs this information tocorrectly report completions. In conjunction with stored TCP connectioncontext information, an RDMA-enabled network adapter can determine fromthe information supplied within a DDP header regarding queue number,message sequence number, message offset, and the last flag whether allof the segments of a given RDMA message have been received and placed,thus allowing for in-order completion reporting.

Regarding tagged RDMA messages, including RDMA Write and RDMA ReadResponse, the only information of this sort which is supplied withintheir respective DDP headers are the steering tag (“STag”) and tagoffset (TO) fields. To recap, contents of the STag field specifies aparticular buffer address for placement of data which has beenpreviously negotiated between sender and receiver. And contents of theTO field prescribe an offset from the buffer address for placement ofthe data. There is no other information provided within a tagged DDPheader that allows an RDMA-enabled network adapter to distinguish onetagged RDMA message from the next. And to report completions of RDMAoperations in order, it is required to know which particular RDMAmessage has been received.

The ability to process and directly place out-of-order received DDPsegments to a consumer buffer (identified by contents of the Stag fieldin the DDP header) is a very powerful feature which allows a reductionin memory size and memory bandwidth required for TCP stream reassembly,and furthermore reduces the latency of a corresponding RDMA operation.To allow for proper processing of placed data by a consumer application,RDMA messages must be reported to the consumer application as beingcompleted in the order these RDMA messages were transmitted by thesender. The distinction between placement and completion (also referredto as “delivery”) is common to prevailing RDMA, protocols, asexemplified by the RDMAC and IETF specifications noted above.Accordingly, an RDMA-enabled network adapter is allowed to placepayloads of received DDP segments to consumer buffers in any order theyare received, and as soon as the network adapter has enough informationto identify the destination buffer. The consumer itself is not awarethat the network adapter has placed the data. Yet, while data can beplaced to the consumer buffer in any order, the consumer is allowed touse data only after it has been notified via the above describedcompletion mechanisms that all data was properly received and placed tothe consumer buffers. Thus, the consumer is not allowed to “peek” intoposted buffers to determine if data has been received. Consequently, anRDMA-enabled network adapter must track out-of-order received and placedDDP segments to guarantee proper reporting of RDMA message completion,and to furthermore preserve the ordering rules described earlier.

It has been noted that tagged RDMA message types such as RDMA ReadResponse and RDMA Write do not carry message identifiers and thus,neither do their corresponding DDP segments. The information carried intheir respective DDP segment headers, like contents of the STag and TOfields is necessary to identify a particular consumer buffer, but thisinformation alone cannot be used to uniquely identify a particular RDMAmessage. This is because more than one RDMA message, sent sequentiallyor otherwise, may designate the same consumer buffer (Stag) and offset(TO). Furthermore, any number of network retransmission scenarios canlead to multiple receptions of different parts of the same RDMA message.

The ability to identify out-of-order placed messages is particularlyimportant for RDMA Read Response messages, because placement of datacorresponding to a Read Response message often requires a receivingRDMA-enabled network adapter to complete one or more outstandingconsumer RDMA Read Requests.

Consider the following scenarios which illustrate the difficulties thata receiving RDMA-enabled network adapter can experience when it isrequired to determine which of many outstanding consumer RDMA ReadRequests it can complete, after it has placed data from a DDP segmentthat has been received out-of-order. In a first case, as mentionedabove, more than one RDMA Read Request can designate the same data sinkconsumer buffer. Thus, the RDMA-enabled network adapter issues multiplesequential one-byte RDMA Read Requests having the same local (data sink)consumer buffer, identified by the same (STag, TO, RDMA Read MessageSize) triple. Subsequently, the same RDMA-enabled network adapterreceives and places an out-of-order one-byte RDMA Read Response messagehaving the (Slag, TO, RDMA Read Message Size) triple. Since theRDMA-enabled network adapter has multiple outstanding RDMA Read Requestswith the same (STag, TO, RDMA Read Message Size) triple, thisinformation is inadequate to identify which of the outstanding RDMA ReadRequests is affiliated with the placed data.

In a second case, it is probable that the same DDP segment for an RDMARead Response message type can be received more than once due toretransmission or network re-ordering. And although an RDMA networkadapter is allowed to place such a segment multiple times into itstarget consumer buffer, the corresponding message must be reported ascompleted only once to the ULP. As a result of these scenarios, oneskilled in the art will appreciate that the receiving RDMA-enablednetwork adapter cannot simply count the total number of out-of-orderplaced DDP segments with the Last flag set to determine the number ofcompleted corresponding RDMA Read Response messages. Nor can itfurthermore use this number to complete associated outstanding. RDMARead Requests posted by the consumer.

In a third scenario, previously received and placed out-of-order RDMARead Response segments may be discarded for, in some situations, thereceiving RDMA-enabled network adapter can run out of resources, and mayneed to discard some portion of previously received and placed data,which may include one or more out-of-order placed and accounted fortagged DDP segments. This often means the RDMA-enabled network adaptermust nullify its plans to eventually generate completions for theaffected out-of-order placed RDMA Read Response messages, which can bealgorithmically difficult.

Another undesirable mechanism provides only for placement of DDPsegments that are received in order. Thus, a receiving RDMA-enablednetwork adapter may directly place only in-order received DDP segments,and will either drop or reassemble out-of-order received segments. Todrop out-of-order received segments is disadvantageous from aperformance perspective because dropping segments causes unnecessarynetwork overhead and latency. Reassembly requires significant on-boardor system memory bandwidth and size commensurate with the implementationof reassembly buffers which are commensurate with a high speednetworking environment.

In contrast, apparatus and methods for in-order reporting of completedRDMA messages according to the present invention do not limit the numberof segments that can be out-of-order received and directly placed to theconsumer buffers, and scales well with the number of out-of-orderreceived segments. The present invention additionally allows tracking ofuntagged RDMA messages which do not carry a message identifier in theheader of their corresponding DDP segments, to include RDMA messagetypes such as RDMA Read Response and RDMA Write. Techniques according tothe present invention are based on additional employment of a datastructure that is used to track information needed to provide for theselective acknowledgement option of TCP (i.e., TCP SACK option), whileextending this structure to keep additional per-RDMA message typeinformation.

In contrast, apparatus and methods for in-order tracking and reportingof completed RDMA messages according to the present invention do notlimit the number of segments that can be out-of-order received anddirectly placed to the consumer buffers, and scales well with the numberof out-of-order received segments. The present invention additionallyallows tracking of untagged RDMA messages which do not carry a messageidentifier in the header of their corresponding DDP segments, to includeRDMA message types such as RDMA Read Response and RDMA Write. Techniquesaccording to the present invention are based on additional employment ofa data structure that is used to track information that needed toprovide for the selective acknowledgement option of TCP (i.e., TCP SACKoption), while extending this structure to keep additional per-RDMAmessage type information.

Referring now to FIG. 11, a diagram 1100 is presented highlightingaspects provided according to the present invention that allow forout-of-order placement of received data while ensuring that messagecompletions are tracked and reported in order. The present inventionutilizes information that is required to perform TCP selectiveacknowledgement (TCP SACK), as is specified in RFC 2018, “TCP SelectiveAcknowledgement Options,” The Internet Engineering Task Force, October1996, available at http://www.ietf.org/rfc/rfc2018.txt. An in-depthdiscussion of this option is beyond the scope of this application, butit is sufficient to note that TCP SACK is employed by a data receiver toinform the data sender of non-contiguous blocks of data that have beenreceived and queued. The data receiver awaits the receipt of data(perhaps by means of retransmissions) to fill the gaps in sequence spacebetween received blocks. When missing segments are received, the datareceiver acknowledges the data normally by advancing the left windowedge in the Acknowledgment Number field of the TCP header. Eachcontiguous block of data queued at the data receiver is defined in theTCP SACK option by two 32-bit unsigned integers in network byte order. Aleft edge of block specifies the first sequence number of this block,and a right edge of block specifies the sequence number immediatelyfollowing the last sequence number of the contiguous block. Each SACKblock represents received bytes of data that are contiguous andisolated; that is, the bytes just below the block and just above theblock have not been received. With this understanding, the diagram 1100depicts several likely scenarios 1110, 1120, 1130, 1140, 1150, 1160 thatillustrate how reception of DDP segments is viewed according to thepresent invention in terms of TCP sequence numbers.

A first scenario 1110 depicts three received sequence number ranges1101: a first sequence number range SR1 which has been received inorder. SR1 has a left edge sequence number of S1 and a right edgesequence number of S2. A second sequence number range SR2 is defined bya left edge of S6 and a right edge of S7. A sequence number void HR11102 (also referred to as a “hole” or “interstice”) represents TCPsequence numbers which have not yet been received. Accordingly, a leftedge of HR1 is defined by sequence number S2 and a right edge by S6.Since the sequence numbers of HR1 have not been received, sequencenumber range SR2 is said to be received “out-of-order.” In like fashion,void HR2 defines another range of TCP sequence numbers that have notbeen received. HR2 has a left edge of S7 and a right edge of S10. Andanother sequence number range SR3 is thus received out-of-order becauseof void HR2 SR3 has a left edge of S10 and a right edge of S11.

Consider now that additional data is received over a corresponding TCPstream by an RDMA-enabled network adapter according to the presentinvention. Scenarios 1120, 1130, 1140, 1150, and 1160 discuss differentways in which the additional data can be received as viewed from theperspective of TCP sequence number space in terms of in-order andout-of-order received segments.

Consider scenario 1120 where additional data having sequence numberrange SR4 is received. SR4 has a left edge of S2, which corresponds tothe right edge of in-order sequence number range SR1. Consequently, theaddition of SR4 can be concatenated to in-order range SR1 to form alarger in-order sequence number range having a left edge of S1 and aright edge of S4. A void (not precisely depicted) still remains prior toSR2 and SR3. Thus SR2 and SR3 remain as out-of-order received segments.

Consider scenario 1130 where additional data having sequence numberranges SR5 and SR6 is received. SR5 has a left edge of S7, whichcorresponds to the right edge of out-of-order sequence number range SR2.Consequently, the addition of SR5 can be concatenated to out-of-orderrange SR2 to form a larger out-of-order sequence number range having aleft edge of S6 and a right edge of S8, but the range still remainsout-of-order because of the void between SR1 and SR2. Likewise, SR6 hasa right edge of S10, which corresponds to the left edge of out-of-ordersequence number range SR3. Thus, the addition of SR6 can be concatenatedto out-of-order range SR3 to form a larger out-of-order sequence numberrange having a left edge of S9 and a right edge of S11, but the rangestill remains out-of-order because of the void between SR1 and SR2 andthe void between SR5 and SR6.

Scenario 1140 is provided to illustrate complete closure of a voidbetween S7 and S10 by additional data SR7. SR7 has a left edge of S7,which corresponds to the right edge of out-of-order sequence numberrange SR2 and SR7 has a right, edge of S10, which corresponds to theleft edge of SR3. Accordingly, the addition of SR7 is concatenated toout-of-order ranges SR2 and SR3 to form a larger out-of-order sequencenumber range having a left edge of S6 and a right edge of S11. A voidstill remains prior to SR2 and consequently, the larger number rangedefined by S6 and S11 is still out-of-order.

Scenario 1150 illustrates additional data received between S3 and S5,which adds another out-of-order sequence range SR8 to that already notedfor SR2 and SR3. SR8 is shown received between SR1 and SR2 in TCPsequence number space, however, since SR1, SR8, and SR2 have nodemarcating edges in common, SR8 simply becomes another out-of-ordersequence number space.

Finally, scenario 1160 illustrates additional data received between S12and S13, which adds another out-of-order sequence range SR9 to thatalready noted for SR2 and SR3. SR9 is shown received to the right ofSR3, thus providing another out-of-order sequence number space SR9 andanother void that is defined by S11 and S12.

An RDMA-enabled network adapter according to the present inventionprovides for reception, tracking, and reporting of out-of-order receivedTCP segments, like segments SR2, SR3, SR8, SR9, and the concatenatedlonger out-of-order segments discussed above. The network adapterutilizes this information, in conjunction, with the information providedin corresponding received DDP segment headers (i.e., STag, TO and thelast flag) to efficiently and effectively track and report completionsof RDMA messages in order, while still allowing for direct placement ofdata from out-of-order received DDP segments. In one embodiment,transaction logic as discussed above with reference to FIGS. 5-7 recordsdata corresponding to out-of-order and in-order received TCP segments inorder to reduce the number of TCP segments that need to be retransmittedby a sender after an inbound TCP segment is lost, or reordered by thenetwork. One record per out-of-order segment range is kept. Each recordincludes the TCP sequence number of the left and right edges of anout-of-order segment range. In an alternative embodiment, one record perTCP hole is kept where each record includes the TCP sequence number ofthe left and right, edges of a TCP hole. Hereinafter, details of theout-of-order segment range record are described and it is noted that oneskilled in the art will be able to apply these details to implement anduse the TCP hole embodiment.

To properly support placement of out-of-order received DDP segments, thetransaction logic, in addition to recording TCP sequence numbers foreach out-of-order segment range, also records the number of received DDPsegments which had a corresponding last flag asserted thr eachout-of-order segment range. This is performed for each RDMA message typenewly received and placed. In one embodiment, these records comprisecounter fields which are referred to in more detail below asRDMAMsgTypeLastCnt. For RDMA Read Response messages, the counter fieldis referred to as RDMAReadRespLastCnt. For RDMA Write messages, thecounter field is referred to as RDMAWriteLastCnt.

When a DDP segment with last flag asserted is received, the transactionlogic identifies the in-order or out-of-order segment range to which thesegment belongs and increments the respective RDMAMsgTypeLastCnt fieldbelonging to that segment range, if the segment has not already beenreceived and placed in the respective segment range. In one embodiment,an RDMA-enabled network adapter according to the present inventionsupports 65,536 out-of-order segment range records, and if a DIP segmentarrives when these records are all in use it may drop the newly arrivedDDP segment or discard a previously received out-of-order segment rangeby deleting its associated out-of-order segment range record. When anout-of-order segment range record is deleted, all RDMAMsgTypeLastCntvalues included in that out-of-order segment range record are likewisediscarded.

When a TCP hole is closed, same-type RDMAMsgTypeLastCnt counters of thejoined segment ranges are summed for each RDMA message type, and thissummed information is kept in a record for the joined segment range.Summing is performed when an in-order segment range is concatenated withan out-of-order segment range, and also when two adjacent out-of-ordersegment ranges are joined.

When the transaction logic advances a corresponding TCP.RCV.NXT receivesequence variable upon closure of a TCP hole adjacent to an in-ordersegment range and placement of associated data payload, it will thengenerate and report completions associated with this previously placeddata which is now in-order in TCP sequence space to the ULP. TheRDMAMsgTypeLastCnt counters make it easy to determine how many RDMAmessages are contained within said previously placed data. Thesecounters, along with additional connection context information such as,the message type, notify_on_completion, and final_seq_num parametersstored in the Transmit FIFO described above are employed to generate andreport message completions. For example, suppose that there are threeRDMA Read requests outstanding when an RDMA Read Response segment havinga last flag asserted is received that closes a TCP hole between anin-order segment range having no last flags asserted and an out-of-ordersegment range having two last flags asserted. Since out-of-order dataplacement is supported, all of the data in the out-of-order segmentrange has already been received and placed, including two segments withthe Last flag set that correspond to two of the outstanding RDMA Readrequests. Thus, the counter RDMAReadRespLastCnt is set to 2 for theout-of-order segment range. The arrival of the missing segment thatfills the void enables the transaction logic to move the correspondingTCP.RCV.NXT variable from the right edge of the in-order segment rangeto the right edge of the out-of-order segment range. Once the missingsegment is placed, following the algorithm described previously, theRDMAReadRespLastCnt for the in-order segment range (which is equal to 1because the missing segment has its last flag set) is summed to theRDMAReadRespLastCnt corresponding to the out-of-order segment (which isequal to 2 as noted), to yield an RDMAReadRespLastCnt equal to 3 for thejoined segment range. Because there are three RDMA Read requestsoutstanding, and based on the RDMAReadRespLastCnt summation, thetransaction logic determines that all three of the associated readresponses have been placed and are now in-order in TCP sequence space.Accordingly, a completion for each of the outstanding RDMA Read requestsis generated and reported to the ULP.

Now referring to FIG. 12, a block diagram is presented of anRDMA-enabled server 1200 according to the present invention featuring amechanism for performing speculative MPA CRC calculations along with amechanism for in-order delivery of RDMA messages. The server 1200 ofFIG. 12 includes elements substantially the same as and configuredsimilarly in fashion to like-named and numbered elements described abovewith reference to FIG. 7, where the hundreds digit is replaced with a“12.” in contrast to the server 700 of FIG. 7, the server 1200 of FIG.12 includes an out-of-order processor/MPA reassembly processor (OOP/MRP)1217 within the protocol engine 1208 and includes information stores1210 which is coupled to the protocol engine 1208. The server 1200according to the present invention also includes a MAC packet parser(MPP) 1220 within each of the MACs 1212. An alternative embodiment iscontemplated where corresponding MPPs 1220 exist as elements separatefrom each of the MACs 1212 and are coupled to corresponding MACs 1212and to the transaction logic 1207.

Operation of the server 1200 is described first with respect to trackingand reporting of completed RDMA operations. When a connectionexperiences inbound packet loss, an out-of-order segment range recordwithin the information stores 1210 is dynamically allocated and is boundto a corresponding TCP connection, as alluded to above, thus providingfor communication of TCP SACK option data to an associated partner asdefined by the connection. One out-of-order segment range record (or,“SACK context record”) is employed per TCP connection. An out-of-ordersegment range record is dynamically bound to a given TCP connection byupdating a field in a TCP connection context stores record thatcorresponds to the TCP connection, TCP connection context stores arealso part of the information stores 1210, as will be described infurther detail below. In one embodiment, 65,535 out-of-order segmentrange records are provided for according to the present invention. Inthe event that all SACK context records have been allocated, TCP fastretransmit/TCP retransmission is employed rather than TCP SACK. EachSACK context record provides for tracking of up to four variable-sizedSACK blocks. Thus, up to four contiguous ranges of TCP data payload canbe received out-of-order and tracked for each allocated connection.

The OOP/MRP 1217 performs operations related to any inbound packet thatarrives out-of-order. These operations include updating SACK contextrecords as previously described and also include tracking and update ofconnection state associated with any FPDU that is received which has anMPA CRC error, along with tracking and update of connection stateassociated with partial FPDUs, multiple PDUs within an single TCPsegment, and unaligned FPDUs as described above. In addition, theOOP/MRP 1217 dynamically binds SACK Context records to work queues forwhich data has been placed out-of-order and which have outstanding RDMAread requests and/or uncompleted RDMA sends, or unscheduled inbound RDMAread requests. For these types of messages, entries within theout-of-order segment range record stores 1210 are created and updateduntil all associated segments have been received in order and data hasbeen placed by the transaction logic 1205 into host memory 1203. Whenall of the associated segments have been received and their data placed,the transaction logic 1207 reports outstanding messages as beingcomplete to the ULP.

With regard to performing MPA CRC calculations, the present inventorsnote that it would be disadvantageous to compute and perform CRCvalidations when FPDUs have been fully received prior to placing theirassociated data into host memory 1203. At that point, all the requiredstate information would be available for calculating a CRC and forcomparing the calculated CRC with a corresponding MPA CRC field;specifically, the starting TCP sequence number of the MPA header thatcontains the length of the PDU. But the present inventors also note thatthis approach is limiting when an MPA CRC error is detected because allthe state that was processed and updated based on receiving an FPDU mustbe discarded (i.e., rolled back) because the FPDU is found to be inerror. A further problem with this approach is that when a CRC error isdetected, an adapter operating at 10 Gb/sec line speeds would mostlikely have processed a number of subsequent FPDUs based on erroneousstate information, which further complicates a roll back function to alast known good state. These are only two of the numerous disadvantagesassociated with waiting until PDUs are ready for placement in hostmemory 1203 prior to performing CRC computations. Other undesirableapproaches include calculation of CRCs after complete reception of anEthernet frame or providing intermediate buffering of received FPDUs forpurposes of performing CRC calculations. Both of these approaches addlatency to the flow.

The present invention overcomes the problems noted above, and others, byperforming a speculative MPA CRC check while a frame is streamingthrough an associated MPP 1220 into the transaction logic 1207.Accordingly, a presumed aligned FPDU contained therein is known to bevalid within a few cycles of receiving the end of the corresponding TCPsegment. To perform the speculative check involves making assumptionsregarding the configuration of the received TCP segment, as will befurther described below. By assuming the configuration of the receivedsegment, an RDMA-enabled network adapter is provided which allows foron-the-fly MPA CRC calculations to be made concurrent with packetreception.

As has been previously noted, TCP is a byte stream oriented protocolwhich doesn't have to preserve TCP segment boundaries, thus making itdifficult to locate the MPA headers in the data stream. Furthermore, theMPA protocol allows for the inclusion of MPA markers in FPDUs thatpoint, back to corresponding MPA headers. Although marker placement isallowable as an option under MPA, it is not required. When enabled,these markers must be placed every 512 octets in the TCP byte stream.Placing markers in the TCP stream enables an RDMA-enabled networkadapter according to the present invention to place received FPDUs outof order into host memory 1203 as described above. Once an MPA header islocated in the TCP byte stream, its corresponding FPDU is processed asare any subsequently received FPDUs received.

One skilled in the art will appreciate, however, that because MPAmarkers must be placed at 512-byte intervals in the TCP byte stream,they can occur anywhere in a TCP data segment, including anywhere fromimmediately preceding an MPA header to immediately preceding acorresponding MPA CRC field. For the special case where the MPA markerimmediately precedes the MPA header, the pointer field therein is set tozero. Thus, the MPA marker may be found within DDP or RDMAP headers, orwithin the FPDU data itself.

As stated earlier, it is desirable from the standpoint of implementingan efficient RDMA-enabled network adapter to provide for the use of MPAmarkers, and to furthermore provide for the transmission of alignedFPDUs. However, not all connections are required to use markers, and itis probable that such an adapter may be deployed in environments thatresult in the reception (or even transmission) of unaligned FPDUs due tosegmentation, segment combining, IP fragmentation, change in MSS size inthe presence of timeouts, etc. For example, an FPDU may be received thathas no marker therein, or multiple markers (a function of packet size).The FPDU may have only data, or data and one or more markers. The TCPsegment may have a partial MPA header, or multiple MPA headers andassociated FPDU data. The TCP segment may include an integral number ofFPDUs or some number of complete FPDUs and up to two partial FPDUs. TheOOP/MRP 1217 and out-of-order segment range record stores 1210 areemployed to deal with the situations where received segments cannot beimmediately validated and placed, and such processing, which requiresintermediate buffering of said received segments, does indeed addlatency to the flow. Accordingly, unaligned frames which are received bythe MACs 1212 are processed by the protocol engine 1208 for purposes ofperforming CRC calculations and validation of MPA CRCs. But the presentinventors contemplate that any of the above cases that result in thereception of unaligned FPDUs, partial FPDUs, or out-of-order FPDUs areexceptional, and to provide a baseline adapter 1205 which waits tovalidate MPA CRCs until in-order reception of TCP segments has beenverified by the protocol engine 1208 would result in an exceedinglyinefficient flow of packets at the line speeds contemplated.

Accordingly, the block, diagram 1200 includes a MAC packet parser 1220within each of the MACs 1212. The MPPs 1220 each perform speculativeon-the-fly stateless MPA CRC calculations by making assumptions aboutthe properties of received TCP segments, as will be described in moredetail below, thus avoiding the latency penalty and bandwidthrequirements of making a separate pass through the data followingverified in-order reception.

For received packets, the MPPs 1220 perform packet classification andbasic checks while packets are flowing into the transaction switch 1209.More specifically, the MPPs 1220 perform speculative MPA CRC validationsfor all received packets. All of these speculative operations areperformed “stateless,” that is, without a priori knowledge of TCPsegment contents. To perform these operations, the MPPs 1220 considerthat every TCP segment received is for an accelerated TCP connection andthat the TCP segment indeed contains RDMA FPDUs. This assumption willnot always be correct because, in an adapter that supports bothaccelerated TCP connections (connections as described herein) andconventional (i.e., “unaccelerated”) TCP connections, many received TCPsegments will not contains FPDUs as previously described. One skilledwill appreciate that at the MAC processing level, when a TCP segment isreceived, it's corresponding connection context is yet to be determined.But if it turns out that presumptions about the received packet arecorrect, then flow latency has been precluded because corresponding MPACRC checks have been performed concurrent with packet reception. Iflater processing determines that the packets do not correspond toaccelerated RDMA-enabled connections, then the CRC status is discarded,at no additional cost to processing time.

In addition, the MPPs 1220 consider that every TCP segment receivedstarts with an MPA header immediately following the TCP header. As oneskilled in the art will appreciate, a TCP header within a receivedEthernet frame is always at the same location and can be easily locatedduring reception. Thus, the present invention provides for anRDMA-enabled network adapter 1200 that is optimized for handling mostprobable reception conditions rather than the exception conditionscaused by combining, resegmentation, and the like. Furthermore, the MPPs1220 presume three mutually exclusive cases for use of markers andperform MPA CRC checks in parallel for each of the three cases. A firstcase performs MPA CRC checks (i.e., MPA CRC comparison) under theassumption that MPA markers have not been enabled and that every TCPsegment received contains one (or more) complete FPDUs without any MPAmarkers. A second case performs MPA CRC checks under the assumption thatMPA markers are enabled and that every TCP segment received contains one(or more) complete FPDUs with MPA markers, where the FPDUs contain aminimum number of MPA markers based upon the number of bytes received.For example, a received TCP segment having 100 bytes for FPDUs can havea minimum of 0 MPA markers and a maximum of 1 MPA markers placedtherein, because MPA markers must be placed every 512 bytes in the TCPstream. Finally, a third case performs MPA CRC checks under theassumption that MPA markers are enabled and that every TCP segmentreceived contains one more) complete FPDUs with MPA markers, where theFPDUs contain the maximum number of MPA markers based upon the number ofbytes received. These three stateless MPA CRC checks are performedconcurrent with reception of each packet and the results of all threechecks are provided to the protocol engine 1208 following packetreception.

Recall that the protocol engine 1208 has access to the connectioncontext for the received TCP segment, and thus can determine whether aconnection is accelerated or not, whether markers are employed or not,whether partial FPDUs are expected or not, and etc. Consequently, theprotocol engine 1208 selectively employs the results of the three CRCchecks provided by each of the MPPs 1220 for each received TCP segment.For example, if a given received TCP segment is classified by theprotocol engine 1208 as unaccelerated, then the CRC status results arediscarded. If the connection context is not for an RDMA connection, theCRC status results are discarded. If the connection context indicatesthat the connection is an accelerated RDMA connection, then the protocolengine 1208 selectively employs the CRC status results based uponwhether or not markers are enabled and utilizes either minimum marker ormaximum marker CRC status results based upon calculation of markerpositions as determined by locations of previous markers and receivedTCP sequence numbers. One embodiment contemplates connections where MPACRC checking is disabled. In such an embodiment, all three statusresults are discarded. Any exceptional cases (e.g., partial FPDUs,incorrect CRCs, etc) are provided to the OOP/MRP 1217 for furtherprocessing.

Now referring to FIG. 13, a block diagram is provided illustratingdetails of an exemplary MPP 1300 according to the present invention. TheMPP 1300 includes segment detect logic 1301 that is coupled to a nomarker CRC engine 1302, a minimum marker CRC engine 1303, and a maximummarker CRC engine 1304. The segment detect logic 1301 receives anEthernet frame via bus FRAME from within a corresponding MAC andindicates a TCP segment start via bus SEGSTART to each of the engines1302-1304. The TCP segment data is provided to each of the engines1302-1304 via bus SEGSTRM.

The no marker engine 1304 generates three status bits 1305, S1-S3. Theminimum marker engine 1303 generates three status bits 1305, S4-S6 andan output that provides status bit S4 is coupled back to the maximummarker CRC engine 1304. The maximum marker engine 1304 generates threestatus bits 1305. S7-S9 and an output providing status bit S7 is coupledback to the minimum marker CRC engine 1303. The minimum marker engine1303 and the maximum marker engine 1304 jointly provide outputs to ajointly developed status bit 1306, S10.

In operation, the no marker CRC engine 1302 generates CRCs on incomingpackets under the no marker assumptions detailed above. Moreparticularly, the segment detect logic 1301 indicates the start of a TCPsegment via bus SEGSTRM and the no marker engine 1302 determines thelocation of a speculative ULPDU_length field therein by assuming thatthe two bytes immediately following the TCP header contain the MPAheader (of which the ULPDU_length field is a part). The contents of thelength field indicate the length in bytes of the FPDU. Based on thatlength, the engine 1302 calculates a location in the TCP streamcontaining speculative MPA CRC bytes. Accordingly, the engine 1302performs a cyclic redundancy check on all the data using the speculativeMPA CRC, to determine whether the CRC is correct. If data is still beingreceived for the current TCP segment and a previous MPA CRC check wascorrect, then the no marker CRC engine 1302 continues by reading thenext two bytes following the speculative MPA CRC bytes and interpretsthe next two bytes as a ULPDU_length field for a following FPDU. Theengine 1302 thus performs a following MPA CRC calculation for thefollowing FPDU. The segment detect logic indicates the end of the TCPsegment over bus SEGSTART. Accordingly, at the end of the TCP segmentthe no marker CRC engine reports to the protocol engine the results ofthe MPA CRC checks in the form of the three status bits S1-S3: assertionof bit S1 indicates a good CRC. Assertion of bit S2 indicates multipleFPDUs. And assertion of bit S3 indicates a had CRC or a partial FPDU.

For example, if the no marker CRC engine 1302 detects an invalid CRC orthere is not enough data to perform the CRC calculation (as can occurwhen a partial FPDU is received), then the engine 1302 stops performingCRC calculations for the remainder of the current TCP segment and willassert bit S3, thus indicating a bad CRC or partial FPDU. Bits S1 and S2are deasserted. After stopping, the engine 1302 will begin calculatingCRCs at the start of the next TCP segment received, as indicated by busSEGSTART.

If the no marker engine 1302 calculates multiple valid MPA CRCs, then itwill assert bits S1 and S2, indicating good CRCs and multiple FPDUsreceived. Bit S3 is deasserted to indicate that multiple valid FPDUs arepresent in the received TCP segment and all FPDUs have valid MPA CRCs.

If there are multiple FPDUs in the TCP segment and one or more of theMPA CRCs are good, but at least one invalid MPA CRC is detected, thenthe no marker engine 1302 deasserts bits S1 and S2 and asserts bit S3,indicating a had CRC.

The minimum marker engine 1303 and the maximum marker engine 1304 areemployed to perform MPA CRC checks under the above noted assumptionsthat MPA markers are being employed. Recall, when a TCP segment isreceived by a MAC, the MAC has no state information available todetermine exactly how many markers the TCP segment contains. Forconventional Ethernet framing, the TCP segment can contain between 0 and18 markers. One skilled will appreciate that Ethernet 9K jumbo packetshave enough bytes for 18 markers placed at 512-byte intervals. Forexample, if an FPDU is received that is 100 bytes long, there could be 0or 1 marker placed therein. Accordingly, there are two possiblespeculative MPA CRC locations for this FPDU: one assuming the minimumnumber of MPA Markers (0) and the other assuming the maximum number ofMPA Markers (1). Thus, the minimum marker CRC engine 1303 assumes thefewest number of markers present to determine the location of thespeculative MPA CRC field and the maximum marker engine 1304 assumes themaximum number of MPA markers present to determine the location of thespeculative MPA CRC field. In the case of a 100-byte FPDU containedwithin a TCP segment, the minimum marker engine 1303 assumes 0 markersand the maximum marker engine 1304 assumes 1 MPA marker present. If aTCP segment is received where the assumed ULPDU_length field contains512 bytes or less, then there could be 0 or 1 marker present. If theULPDU_length is say, 516 bytes, there could be either 1 or 2 markerspresent. If the ULPDU_length is 1400 bytes, there could be 2 or 3markers present in the data stream. And so on. Hence, the minimum andmaximum marker engines 1303-1304 are collectively called the markerengines 1303-1304.

The minimum marker engine 1304 thus calculates and validates aspeculative MPA CRC assuming a received TCP segment has the fewestnumber of markers that can be present. Likewise the maximum markerengine 1304 validates a speculative MPA CRC assuming the received TCPsegment contains the maximum number of markers. Both marker engines1303-1304 assume that the two bytes immediately following the TCP headerin a received stream, as indicated by bus SEGSTART, contain the MPAULPDU_length field and the engines 1303-1304 thus calculate respectiveCRCs for all the data up to and including their correspondingspeculative MPA CRC locations. The marker engines 1303-1304 perform acyclic redundancy check on all the data using their respectivespeculative MPA CRCs, to determine whether each CRC is correct. Theminimum marker engine 1304 calculates its CRC on all the data up to andincluding its associated MPA CRC location, but assumes there are Nminbytes in the FPDU representing the minimum number of markers possible,where Nmin=minimum number of markers*4 bytes. The maximum marker engine1304 calculates its CRC on all the data up to its correspondingspeculative MPA CRC location, but assumes there are Nmax bytes in theFPDU representing the maximum number of markers possible, whereNmax=maximum number of markers*4 bytes.

When the end of a TCP segment is reached, as indicated by bus SEGSTART,the results of the minimum marker and maximum marker engines 1303-1304are reported in the seven additional status bits 1305-1306, S4-S10 tothe protocol engine. Bits S4 and S7 indicate a good CRC check. Bits S5and S8 indicate respective indications of multiple FPDUs within the TCPsegment. Bits S6 and S9 indicate respective had CRCs or partial FPDUs.And jointly reported bit S10 indicates an ambiguous CRC check.

In the case that there are multiple FPDUs contained in a single TCPsegment, the minimum marker and maximum marker engines 1303-1304 vote onthe results through cross feedback of the outputs providing bits S4 andS7. The assumption is that an MPA CRC will normally be valid. Hence, ifthe minimum marker engine 1303 reports finding a valid CRC by assertingbit S4, and the maximum marker engine 1304 reports an invalid CRC bydeasserting bit S7, then the maximum marker engine 1304 assumes that theminimum marker engine results (bit S4) were correct and startscalculating a speculative MPA CRC for a following PPM starting from thesame location in the TCP segment where the minimum marker engine 1303starts. On the other hand, if the maximum marker engine finds a validMPA CRC and asserts bit S7 and the minimum marker engine result isinvalid (i.e., S4 is not asserted), then the minimum marker engine readsbit S7 and starts calculating a speculative MPA CRC for a following FPDUstarting from the same location in the TCP segment where the maximummarker engine 1304 starts. If neither the minimum marker engine 1303 northe maximum marker engine 1304 find valid CRCs, then both marker engines1303-1304 stop calculating MPA CRCs for the current TCP segment. Theywill start again upon reception of the next TCP segment, as indicatedvia bus SEGSTART. It is conceivable that given the right data pattern,both the minimum marker engine 1303 and the maximum marker engine 1304will calculate valid CRCs. In that case, as is determined by crossfeedback of bits S4 and S7, the two marker engines jointly report thatthe CRC check is ambiguous by asserting status bit S10. Bits S5-S6 andS8-S9 are controlled are reported to the protocol engine insubstantially the same manner as bits S2-S3 for the no marker case.

The protocol engine uses bits S1-S10 to determine how to process areceived TCP segment. As noted above, if the TCP segment corresponds toan accelerated TCP connection but is not an RDMA connection, then the 10bits 1305-1306 are ignored. If the connection is accelerated and is anRDMA connection, then the protocol engine will determine if markers areenabled or not and if the MPA CRCs are enabled or not, if markers arenot enabled, but MPA CRC checking is enabled, then the protocol enginewill employ bits S1-S3, as reported from the no marker engine 1302 todetermine how to process the corresponding TCP segment. If markers areenabled and the MPA CRC checking is also enabled, then the protocolengine will examine bits S4-S10 to determine how to process the receivedsegment. Since the protocol engine has the required connection contextinformation e.g., TCP sequence numbers and locations of MPA markers), itknows whether to use bits S4-S6 or bits S7-S9 for processing of thecurrent TCP segment.

If MPA CRC checking is not enabled, then bits S1-S10 are ignored and theTCP segment will be processed as allowed by the protocol. For example,if the TCP segment is received in-order or the TCP segment is receivedout-of-order but the MPA marker therein points to the header in thereceived TCP segment, and the length of the TCP segment is sufficient tocontain the entire FPDU, then the segment will be processed.

If MPA CRC is enabled for the connection currently being processed andthe protocol engine receives a had CRC or partial FPDU indication (e.g.,bits S3, S6, and S9) from the selected engine, or if bit S10 isasserted, indicating an ambiguous CRC check, then the TCP segment isrouted to the slow path (i.e., to the OOP/MRP) for additional processingto determine if the actual MPA header perhaps did not immediately followthe TCP header, as is the case for unaligned or partial FPDUs, or todetermine which is the correct MPA CRC in the case where an ambiguousCRC (bit S10) is reported.

Since the MPP 1300 is making assumptions about where the location of theMPA ULPDU_length field is in a packet, it is possible for anRDMA-enabled network adapter according to the present invention toreceive TCP segments that violate the assumptions. For example,retransmitted TCP segments created following a reduction in MSS may nothave valid MPA headers following the TCP header.

For packets that violate the assumptions, it is possible that one (ormore) of the CRC engines 1302-1304 will falsely calculate a valid MPACRC. This can occur when the two bytes read and assumed to be theULPDU_length point to a location in the segment containing what appearsto be a correct MPA CRC. When this false ULPDU_length and MPA CRCentirely fill a TCP segment, then from perspective of the MPP 1300,there is one (or more) valid FPDUs within this TCP segment. The presentinventors note however that the likelihood of the MPP 1300 using a falseULPDU_length and calculating a CRC over all of the intervening data, andfurthermore matching the calculated CRC to whatever random data patternhappens to be at a false MPA CRC location, and moreover for the falseULPDU_length to line up perfectly with the end of the TCP segment, isindeed very low. But to cover such a situation, the protocol engineperforms a marker check to determine if the received segment (while itlooks good to the MPP 1300) is a complete and valid FPDU. This check isperformed by reading a single marker from the received TCP segment andverifying that it points to a valid MPA header if this marker points tothe beginning of the TCP segment, then the protocol engine completesprocessing of the FPDUs contained in the TCP segment. If the markerpoints to a different TCP segment, then the TCP segment does not containa valid MPA and the TCP segment is forwarded to OOP/MRP for processingby the slow path.

If a segment is received out-of-order and there is no marker, or markersare not enabled, then the segment cannot be processed on-the-fly and isthus routed to OOP/MRP for processing by the slow path, even if the MPP1300 reports that this segment has a valid MPA CRC.

By making the assumptions mentioned above, an RDMA-enabled networkadapter according to the present invention can perform speculative MPACRC calculations on-the-fly as packets arrive, thus insuring thatprotocol state is only modified based on valid FPDUs with good MPA CRCs.Checking the MPA CRC concurrent with reception has the advantage thatrollback of context in the case of an MPA CRC error is not required. Andin the most probable reception case (i.e., aligned FPDUs), slow pathprocessing latencies are precluded altogether.

In the discussion above, particularly with reference to FIGS. 12-13,aspects of the present invention are described that enable speculativecalculations of MPA CRCs on-the-fly as packets arrive. This is one ofthe issues, as alluded to earlier, which must be addressed in order foran RDMA-enabled network adapter to operate as multi-Gigabit speeds, andwhich is provided for by the present invention. Another related issue,to recap, is the efficient insertion and removal of MPA markers. Thepresent invention also overcomes the limitations of present daytechniques by providing techniques for on-the-fly insertion and removalof MPA markers, which function effectively even under circumstanceswhere unaligned FPDUs are present within transmitted or received TCPsegments as a result of segment fragmentation or combination. On-the-flyMPA marker insertion and removal techniques will now be discussed withreference to FIGS. 14-15.

Tow turning to FIG. 14, a block diagram is presented of an RDMA-enabledserver 1400 according to the present invention featuring a mechanism foron-the-fly MPA marker insertion and removal. The server 1400 of FIG. 14includes elements substantially the same as and configured similarly infashion to like-named and numbered elements described above withreference to FIG. 12, where the thousands and hundreds digits arereplaced with a “14.” In contrast to the server 700 of FIG. 7, theserver 1400 of FIG. 14 also includes a host frame parser 1418 that iscoupled between the transaction switch 1409 and the host interface 1406.The protocol engine 1408 additionally includes marker logic 1420. Thehost frame parser 1418 is coupled to the transaction switch 1409 via ahost frame parser-transaction switch bus 1421. The protocol engine 1408is coupled to the transaction switch 1409 via a protocolengine-transaction switch bus 1419.

In one embodiment, the protocol engine 1408 communicates with the hostframe parser 1418 by sending transaction requests via buses 1419 and1421. The protocol engine-transaction switch bus 1419 includes a datapath, miscellaneous control signals, and a transaction request bus whichincludes all MPA marker related signals as will be described in furtherdetail below. The host frame parser-transaction switch bus 1421 includesa data path, in control signals, and a transaction request bus whichincludes all of the MPA marker related signals.

Operation of the server 1400 is described in particular below withregard to location, insertion, and removal of MPA markers. Because. MPAmarkers can occur anywhere in a TCP data segment, it is noted that themarkers can occur before an MPA header all the way to before the MPACRC. Identification and location of these markers is critical tolocating the corresponding MPA header, and hence the DDP/RDMAP headers,to allow for processing of data. For aligned FPDUs, location of MPAheaders is relatively easy, but for unaligned FPDUs, insertion andremoval of these markers is not straightforward, and must be performedwithout undue latency in order to allow for RDMA over TCP transactionsto be performed at 10 Gb/sec (and higher) link speeds. The presentinvention accomplishes these noted objectives by distributing the tasksassociated with marker insertion and removal between the protocol engine1408 and the host frame parser 1418. By disposing the host frame parser1418 between the host interface 1406 and the transaction switch 1409, amechanism is provided that enables on-the-fly placement and removal ofmarkers, but which is controlled by the protocol engine 1408. Inaddition to insertion and removal of markers, the host frame parser 1418also performs other in-line operations on packet data flowing to andfrom the host interface 1406. The host frame parser 1418 is configuredto enable the markers to be inserted/removed as data is beingtransferred from/to the host interface 1406. Consequently, there is norequirement that all of the data corresponding to a DMA transaction bebuffered prior to insertion of the markers, or that it be bufferedfollowing removal of the markers. In one embodiment, the host frameparser 1418 is disposed within the host interface 1406.

In one embodiment, the protocol engine 1408 sends DMA requests to thehost frame parser 1418 via buses 1419 and 1421 in one of theaforementioned transaction requests. Information associated with theplacement of MPA markers is also provided to the host frame parser 1418.The host frame parser 1418 stores the provided transaction request andemploys the provided marker related information without furtherinstruction from the protocol engine 1408 whenever payloadscorresponding to the DMA requests are transmitted/received to/from thehost interface 1406. In this embodiment, the protocol engine isconfigured to issue multiple DMA transaction requests to the host frameparser 1418, and the host frame parser provides for correlation of eachset of MPA marker related information with a corresponding set ofpayload data that is transmitted/received to/from the host interface1406.

In one embodiment, the marker logic 1420 within the protocol engine 1408provides the aforementioned MPA marker related information, whichincludes a marker value and a marker offset for payloads received fromthe host interface 1406 (i.e., marker insertion) and a marker offset forpayloads to be provided to the host interface 1406 (i.e., markerremoval). The marker value identifies the value of a first marker toinsert, into the payload (i.e., the value of the pointer to the MPAheader). The marker offset specifies a byte offset into the currentrequested host data transfer where the marker value is to beinserted/removed.

For insertion of MPA marker(s), the host frame parser 1406 inserts thefirst marker as prescribed by the marker logic 1420 and insertssubsequent MPA marker values into the payload by incrementing a currentmarker value by 512. For example, if the marker logic specifies a markervalue of 35 and an offset of 43, then the host frame parser would inserta first marker of 35 at an offset of 43 bytes into the payload. A secondmarker, if required, having a value of 547 would be inserted into thepayload 512 bytes after the first offset location. And so on.

For removal of MPA marker(s) from a payload to be written to host memory1403, the host frame parser 1418 employs the marker offset prescribed bythe marker logic 1420 to locate and remove the first marker from thestream prior to providing the data to the host interface 1406.Subsequent MPA markers are removed by the host frame processor at512-bytes increments from the location prescribed by the marker offset.

Since MPA markers can occur within the MPA/DDP/RDMAP headers (i.e. notwithin the data from host memory 1403 which is transferred by the hostinterface 1406), placement/removal of MPA markers under this case isperformed by the marker logic 1420 itself within the protocol engine1408 rather than by the host frame parser 1418.

Referring to FIG. 15, a block, diagram is presented featuring details ofthe host frame parser 1500 according to the present invention, such asis described with reference to FIG. 14. The host frame parser 1500includes marker insertion logic 1501 that is operatively coupled to aprotocol engine (not shown) via the mechanisms described with referenceto FIG. 14. The host frame parser 1500 also includes marker removallogic 1502 that is operatively coupled to the protocol engine as well asdescribed above.

For insertion of markers, data is retrieved from the host interface (notshown via a host interface data bus 1505 into an ingress FIFO 1503. Theprotocol engine directs the marker insertion logic 1501 via a insertsignal from the host frame parser-transaction switch bus to insertmarkers into the memory data provided to the ingress FIFO 1503 that isassociated with a corresponding transaction request. As noted above, themarker value and offset are provided to the insertion logic 1501 viavalue and offset signals. Accordingly, the marker insertion logic 1501inserts the MPA markers into the associated data and provides formatteddata to buffers in the transaction switch over the host frameparser-transaction switch bus i.e., T/S data).

For removal of markers, data is retrieved from the parser-t/s bus. Theprotocol engine directs the marker removal logic 1502 via a removesignal to remove markers from the provided data that is associated witha corresponding transaction request and to provide the stripped data toan egress FIFO 1504. An offset to the first MPA marker is also providedto the removal logic 1502 via an offset signal. Accordingly, the markerremoval logic 1502 removes the MPA markers from the data and providesthe data to the egress FIFO 1504, which is then retrieved by the hostinterface from the host interface bus 1505 and subsequently written tomemory.

As noted earlier, the marker logic, in the protocol engine provides forplacement and removal of MPA markers when these markers fall within MPA,DDP, or RDMAP header space.

Accordingly, an RDMA-enabled network adapter is provided that canperform in-line on-the-fly insertion and removal of protocol markers fornetwork packet payloads as the payloads are transferred between a hostinterface and buffers within the adapter.

Although the present invention and its objects, features, and advantageshave been described in detail, other embodiments are contemplated by thepresent invention as well. For example, the present invention has beenparticularly characterized in terms of a verbs interface ascharacterized by specifications provided by the RDMA Consortium. Andwhile the present inventors consider that these specifications will beadopted by the community at large, it is noted that the presentinvention contemplates other protocols for performing RDMA operationsover TCP/IP that include the capability to offload TCP/IP-relatedprocessing from a particular CPU. As such speculative ULP CRC checkingmechanisms according to the present invention may be applied where, say,iSCSI, is employed as an upper layer protocol rather than the RDMA overTCP verbs interface. Another such application of the present inventionis acceleration of a conventional TCP/IP connection through interceptionof a socket send request by an application that is not RDMA-aware.

Furthermore, the present invention has been described as providing forRDMA over TCP/IP connections over an Ethernet fabric. This is becauseEthernet is a widely known and used networking fabric and because it isanticipated that the community's investment in Ethernet technologieswill drive RDMA over TCP applications to employ Ethernet as theunderlying network fabric. But the present inventors note thatemployment of Ethernet is not essential to practice of the presentinvention. Any network fabric, including but not limited to SONET,proprietary networks, or tunneling over PCI-Express, that provides fordata link and physical layer transmission of data is suitable as asubstitute for the Ethernet frames described herein.

Moreover, the present invention has been characterized in terms of ahost interface, that is embodied as PCI-X or PCI Express. Suchinterconnects today provide for communication between elements on theinterconnect and a memory controller for the purpose of performing DMAtransfers. But the medium of PCI is employed only to teach the presentinvention. Other mechanisms for communication of DMA operations arecontemplated. In fact, in an embodiment where an RDMA-enabled networkadapter according to the present invention is entirely integrated into amemory controller, a proprietary bus protocol may allow forcommunication of DMA transfers with memory controller logic, disposedtherein as well, in complete absence of any PCI-type of interface.

Those skilled in the art should appreciate that they can readily use thedisclosed conception and specific embodiments as a basis for designingor modifying other structures for carrying out the same purposes of thepresent invention, and that various changes, substitutions andalterations can be made herein without departing from the spirit andscope of the invention as defined by the appended claims.

What is claimed is:
 1. An apparatus comprising: an adapter to becommunicatively coupled to a host interface via an interface of theadapter, the adapter also including at least one network port to becommunicatively coupled to a network and to receive one or more framesfrom the network; the adapter including an engine and adapter memory,the adapter to selectively permit data transfer between the at least oneport, the engine, and adapter memory, the engine being able to performprocessing related to protocol offload and checksum calculation basedupon a received transport protocol control (TCP) segment from the one ormore frames, the adapter being able to determine whether the TCP segmentbelongs to an accelerated connection, the adapter also being able toperform one or more additional CRC offload-related operations based uponwhether the TCP segment includes certain upper level internet smallcomputer system interface (iSCSI) protocol header information andbelongs to the accelerated connection, the one or more additional CRCoffload-related operations being related to offloading CRC checking ofthe certain upper level iSCSI protocol header information and also beingin addition to an offloaded TCP CRC validation.
 2. The apparatus ofclaim 1, wherein: a host memory is to comprise a transmission controlprotocol/internet protocol(TCP/IP) stack to perform TCP/IP processingfor an unaccelerated TCP connection; and the adapter is to deliver theTCP segment to the stack for the TCP/IP processing if the TCP segmentbelongs to the unaccelerated connection.
 3. The apparatus of claim 1,wherein: the adapter is to: perform other remote direct memory access(RDMA) protocol processing; and determine whether the TCP segmentincludes an RDMA framed protocol data unit.
 4. The apparatus of claim 1,wherein: the host interface is comprised in a first server; the one ormore frames are to be issued from a second server; and the adapter is tobe comprised in the first server.
 5. A method comprising:communicatively coupling an adapter to a host interface and to anetwork, the adapter to receive one or more frames via the network; theadapter including an engine and adapter memory, the adapter toselectively permit data transfer between at least one adapter port, theengine, and the adapter memory, the engine performs processing relatedto protocol offload and checksum calculation based upon a receivedtransport protocol control (TCP) segment from the one or more frames,the adapter determines whether the TCP segment belongs to an acceleratedconnection, the adapter also performs one or more additional CRCoffload-related operations based upon whether the TCP segment includescertain upper level internet small computer system interface (iSCSI)protocol header information and belongs to the accelerated connection,the one or more additional CRC offload-related operations being relatedto offloading CRC checking of the certain upper level iSCSI protocolheader information and also being in addition to an offloaded TCP CRCvalidation.
 6. The method of claim 5, wherein: a host memory is tocomprise a transmission control protocol/internet protocol(TCP/IP) stackto perform TCP/IP processing for an unaccelerated TCP connection; andthe adapter is to deliver the TCP segment to the stack for the TCP/IPprocessing if the TCP segment belongs to the unaccelerated connection.7. The method of claim 5, wherein: the adapter is to: perform otherremote direct memory access (RDMA) protocol processing; and determinewhether the TCP segment includes an RDMA framed protocol data unit. 8.The method of claim 5, wherein: the host interface is comprised in afirst server; the one or more frames are issued from a second server;and the adapter is comprised in the first server.